./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:51:07,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:51:07,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:51:07,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:51:07,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:51:07,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:51:07,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:51:07,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:51:07,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:51:07,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:51:07,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:51:07,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:51:07,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:51:07,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:51:07,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:51:07,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:51:07,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:51:07,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:51:07,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:51:07,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:51:07,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:51:07,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:51:07,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:51:07,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:51:07,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:51:07,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:51:07,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:51:07,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:51:07,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:51:07,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:51:07,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:51:07,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:51:07,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:51:08,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:51:08,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:51:08,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:51:08,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:51:08,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:51:08,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:51:08,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:51:08,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:51:08,011 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-25 18:51:08,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:51:08,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:51:08,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:51:08,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:51:08,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:51:08,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:51:08,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:51:08,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:51:08,056 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:51:08,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:51:08,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:51:08,058 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:51:08,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:51:08,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:51:08,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:51:08,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:51:08,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:51:08,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:51:08,060 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 18:51:08,060 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:51:08,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:51:08,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:51:08,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:51:08,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:51:08,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:51:08,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:51:08,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:51:08,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:51:08,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:51:08,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:51:08,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:51:08,064 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-25 18:51:08,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:51:08,065 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:51:08,065 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-25 18:51:08,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:51:08,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:51:08,066 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:51:08,066 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:51:08,066 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_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-25 18:51:08,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:51:08,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:51:08,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:51:08,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:51:08,420 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:51:08,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 18:51:11,804 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:51:12,205 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:51:12,217 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 18:51:12,233 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/data/6002d64ec/83e13fef590f4435985b37fd27add935/FLAG912f7caa9 [2022-11-25 18:51:12,252 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/data/6002d64ec/83e13fef590f4435985b37fd27add935 [2022-11-25 18:51:12,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:51:12,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:51:12,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:51:12,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:51:12,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:51:12,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:51:12" (1/1) ... [2022-11-25 18:51:12,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245a9504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:12, skipping insertion in model container [2022-11-25 18:51:12,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:51:12" (1/1) ... [2022-11-25 18:51:12,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:51:12,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:51:13,093 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_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 18:51:13,100 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_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 18:51:13,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:51:13,129 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:51:13,185 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_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 18:51:13,188 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_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 18:51:13,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:51:13,284 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:51:13,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13 WrapperNode [2022-11-25 18:51:13,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:51:13,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:51:13,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:51:13,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:51:13,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,407 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-25 18:51:13,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:51:13,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:51:13,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:51:13,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:51:13,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:51:13,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:51:13,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:51:13,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:51:13,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (1/1) ... [2022-11-25 18:51:13,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:51:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:13,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:51:13,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:51:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 18:51:13,606 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 18:51:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 18:51:13,606 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 18:51:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:51:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:51:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:51:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:51:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 18:51:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:51:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:51:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:51:13,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:51:13,610 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:51:13,865 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:51:13,868 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:51:14,352 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:51:14,364 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:51:14,364 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:51:14,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:51:14 BoogieIcfgContainer [2022-11-25 18:51:14,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:51:14,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:51:14,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:51:14,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:51:14,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:51:12" (1/3) ... [2022-11-25 18:51:14,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6965c0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:51:14, skipping insertion in model container [2022-11-25 18:51:14,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:51:13" (2/3) ... [2022-11-25 18:51:14,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6965c0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:51:14, skipping insertion in model container [2022-11-25 18:51:14,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:51:14" (3/3) ... [2022-11-25 18:51:14,379 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-25 18:51:14,390 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:51:14,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:51:14,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 18:51:14,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:51:14,585 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:51:14,668 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:51:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:51:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:14,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:51:14,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:51:14,764 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:51:14,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-25 18:51:14,787 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;@76c1005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:51:14,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:51:15,387 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-25 18:51:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1319727467, now seen corresponding path program 1 times [2022-11-25 18:51:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:15,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075864625] [2022-11-25 18:51:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:15,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:15,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075864625] [2022-11-25 18:51:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075864625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:15,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:15,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:51:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354729350] [2022-11-25 18:51:15,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:15,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:51:15,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:51:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:51:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:15,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:15,836 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-25 18:51:15,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:15,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:51:15,983 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-25 18:51:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1423842390, now seen corresponding path program 1 times [2022-11-25 18:51:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:15,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587419930] [2022-11-25 18:51:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587419930] [2022-11-25 18:51:16,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587419930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:16,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:16,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:51:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570845065] [2022-11-25 18:51:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:16,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:51:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:51:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:51:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:16,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:16,522 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-25 18:51:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:16,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:16,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:51:16,621 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-25 18:51:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1119853959, now seen corresponding path program 1 times [2022-11-25 18:51:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842527898] [2022-11-25 18:51:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:19,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842527898] [2022-11-25 18:51:19,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842527898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:19,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:19,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-25 18:51:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593685269] [2022-11-25 18:51:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:51:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:51:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:51:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:19,948 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:19,949 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-25 18:51:19,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:19,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:19,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:21,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:51:21,920 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-25 18:51:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -355733740, now seen corresponding path program 1 times [2022-11-25 18:51:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:21,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712685732] [2022-11-25 18:51:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712685732] [2022-11-25 18:51:24,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712685732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:24,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:24,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-25 18:51:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387666552] [2022-11-25 18:51:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:24,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:51:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:51:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:51:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:24,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:24,611 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-25 18:51:24,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:24,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:24,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:24,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:26,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:51:26,457 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-25 18:51:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash -828858809, now seen corresponding path program 1 times [2022-11-25 18:51:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:26,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529854101] [2022-11-25 18:51:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:26,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529854101] [2022-11-25 18:51:26,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529854101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:26,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:26,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:51:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515679029] [2022-11-25 18:51:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:26,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:51:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:51:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:51:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:26,616 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:26,616 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-25 18:51:26,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:26,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:26,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:26,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:26,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:26,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:51:26,783 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-25 18:51:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1017669425, now seen corresponding path program 1 times [2022-11-25 18:51:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:26,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020548441] [2022-11-25 18:51:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:28,219 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-25 18:51:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:28,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020548441] [2022-11-25 18:51:28,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020548441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:28,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589451327] [2022-11-25 18:51:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:28,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:28,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:28,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:28,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:51:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:28,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:51:28,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:29,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:51:29,560 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-25 18:51:29,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:29,688 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-25 18:51:30,035 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:51:30,036 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-25 18:51:30,096 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-25 18:51:30,125 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-25 18:51:30,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:30,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_185) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 18:51:30,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:30,923 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-25 18:51:30,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:30,937 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-25 18:51:30,983 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-25 18:51:31,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:31,027 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 19 treesize of output 11 [2022-11-25 18:51:31,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:31,090 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-25 18:51:32,106 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-25 18:51:32,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589451327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:32,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:32,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 41 [2022-11-25 18:51:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565853766] [2022-11-25 18:51:32,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:32,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 18:51:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 18:51:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1446, Unknown=6, NotChecked=78, Total=1722 [2022-11-25 18:51:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:32,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:32,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 8.634146341463415) internal successors, (354), 42 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:51:32,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:32,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:32,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:32,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:32,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:32,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:33,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:33,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:51:33,955 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-25 18:51:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1482980482, now seen corresponding path program 1 times [2022-11-25 18:51:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:33,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527413346] [2022-11-25 18:51:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:35,964 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-25 18:51:35,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:35,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527413346] [2022-11-25 18:51:35,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527413346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:35,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:35,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-25 18:51:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598484086] [2022-11-25 18:51:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:35,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:51:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:35,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:51:35,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:51:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:35,968 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:35,968 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-25 18:51:35,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:35,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:35,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:35,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:35,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:35,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:35,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:51:36,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:51:36,982 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-25 18:51:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -91224222, now seen corresponding path program 1 times [2022-11-25 18:51:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:36,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369923748] [2022-11-25 18:51:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369923748] [2022-11-25 18:51:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369923748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:42,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:42,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-25 18:51:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871469463] [2022-11-25 18:51:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:51:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:51:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:51:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:42,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:42,831 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-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:51:42,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:51:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:45,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:51:45,706 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-25 18:51:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1467017053, now seen corresponding path program 1 times [2022-11-25 18:51:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:45,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112162899] [2022-11-25 18:51:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:51:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:51,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112162899] [2022-11-25 18:51:51,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112162899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:51:51,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:51:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-25 18:51:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186369701] [2022-11-25 18:51:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:51:51,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:51:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:51,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:51:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:51:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:51,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:51,440 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-25 18:51:51,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:51,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:53,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:51:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:51:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:53,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:51:53,445 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-25 18:51:53,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash 217716167, now seen corresponding path program 1 times [2022-11-25 18:51:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:51:53,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517216898] [2022-11-25 18:51:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:51:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:54,732 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-25 18:51:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:51:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517216898] [2022-11-25 18:51:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517216898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:51:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476473205] [2022-11-25 18:51:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:51:54,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:51:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:51:54,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:51:54,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:51:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:51:54,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 18:51:54,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:51:55,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:51:55,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 18:51:55,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:51:55,951 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-25 18:51:56,295 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:51:56,295 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-25 18:51:56,393 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-25 18:51:56,401 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-25 18:51:56,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:51:57,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:57,330 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-25 18:51:57,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:57,342 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-25 18:51:57,350 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-25 18:51:57,373 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-25 18:51:57,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:57,385 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-25 18:51:57,819 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-25 18:51:57,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476473205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:51:57,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:51:57,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-11-25 18:51:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136185275] [2022-11-25 18:51:57,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:51:57,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 18:51:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:51:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 18:51:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2378, Unknown=15, NotChecked=0, Total=2652 [2022-11-25 18:51:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:57,826 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:51:57,826 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-25 18:51:57,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:57,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:57,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:57,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:57,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:57,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:57,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:51:57,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:51:57,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:57,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:51:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:51:59,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:51:59,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:51:59,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:51:59,999 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-25 18:51:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:51:59,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1840732794, now seen corresponding path program 1 times [2022-11-25 18:51:59,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:52:00,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871651896] [2022-11-25 18:52:00,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:00,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:52:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:03,982 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-25 18:52:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:52:03,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871651896] [2022-11-25 18:52:03,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871651896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:52:03,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529103646] [2022-11-25 18:52:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:52:03,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:52:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:52:03,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:52:04,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:52:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:52:04,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 18:52:04,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:52:04,299 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:52:04,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:52:04,372 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:52:04,373 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-25 18:52:04,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:52:04,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:52:05,211 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-25 18:52:05,454 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-25 18:52:05,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:52:06,011 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-25 18:52:06,012 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-25 18:52:06,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:52:06,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:52:06,337 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-25 18:52:06,784 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-25 18:52:06,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:52:06,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 18:52:07,341 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:52:07,341 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-25 18:52:07,400 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-25 18:52:07,407 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-25 18:52:07,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:52:07,908 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 (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 18:52:08,182 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_404) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 18:52:08,201 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (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| 1604)))) (< (+ (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) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 18:52:08,304 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 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_ArrVal_402 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 18:52:08,539 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 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) (< (+ (select .cse0 .cse2) 1) v_ArrVal_402) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 18:52:08,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((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 ((.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_400)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 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_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse0 .cse3)) v_ArrVal_402))))) is different from false [2022-11-25 18:52:09,289 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse2 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) (< (+ (select .cse0 .cse2) 1) v_ArrVal_402) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 18:52:12,425 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_404 Int) (v_ArrVal_402 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_399))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_402) .cse2 v_ArrVal_404)) |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) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse3 .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_404) (< (+ (select .cse4 .cse1) 1) v_ArrVal_402))))))) is different from false [2022-11-25 18:52:12,820 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 ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_402) .cse2 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_402) (< (+ (select .cse0 .cse2) 1) v_ArrVal_404) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 .cse2))))))))) is different from false [2022-11-25 18:52:13,581 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|) (+ 1608 |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 ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 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_ArrVal_396 0)) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_404) (< (+ (select .cse3 .cse2) 1) v_ArrVal_402) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse4 .cse1))))))))) is different from false [2022-11-25 18:52:13,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:13,614 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-25 18:52:13,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:13,637 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-25 18:52:13,658 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-25 18:52:13,679 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-25 18:52:13,713 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-25 18:52:13,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:13,815 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-25 18:52:14,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:14,654 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 322 treesize of output 338 [2022-11-25 18:52:17,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:17,174 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-25 18:52:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-25 18:52:17,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529103646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:17,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:17,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-11-25 18:52:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115524502] [2022-11-25 18:52:17,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-25 18:52:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:17,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-25 18:52:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=4804, Unknown=32, NotChecked=1530, Total=6972 [2022-11-25 18:52:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:17,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:17,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 4.493975903614458) internal successors, (373), 84 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-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:52:17,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:52:17,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:52:17,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:52:17,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:52:17,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:33,070 WARN L233 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 175 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:52:48,163 WARN L233 SmtUtils]: Spent 12.71s on a formula simplification. DAG size of input: 158 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:00,986 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 156 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:16,438 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 142 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:53:35,541 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-25 18:53:38,563 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-25 18:53:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:53:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:53:51,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 18:53:51,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 18:53:51,837 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-25 18:53:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:53:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -431098475, now seen corresponding path program 1 times [2022-11-25 18:53:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:53:51,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295363575] [2022-11-25 18:53:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:53:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:53:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:53:51,976 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-25 18:53:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:53:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295363575] [2022-11-25 18:53:51,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295363575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:53:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828692590] [2022-11-25 18:53:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:53:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:53:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:53:51,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:53:51,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:53:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:53:52,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:53:52,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:53:52,255 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-25 18:53:52,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:53:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828692590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:53:52,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:53:52,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-25 18:53:52,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858075932] [2022-11-25 18:53:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:53:52,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:53:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:53:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:53:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:53:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:52,258 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:53:52,259 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-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:53:52,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:54,331 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-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:53:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:53:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:53:54,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:53:54,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:53:54,567 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-25 18:53:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:53:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash -479150187, now seen corresponding path program 1 times [2022-11-25 18:53:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:53:54,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830072598] [2022-11-25 18:53:54,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:53:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:53:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:53:54,648 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-25 18:53:54,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:53:54,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830072598] [2022-11-25 18:53:54,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830072598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:53:54,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:53:54,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:53:54,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411273601] [2022-11-25 18:53:54,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:53:54,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:53:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:53:54,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:53:54,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:53:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:54,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:53:54,677 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-25 18:53:54,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:53:54,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:53:54,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:53:54,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:53:54,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:54:09,764 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 125 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:54:21,546 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 169 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:54:23,575 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-25 18:54:25,600 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-25 18:54:27,614 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-25 18:54:37,082 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-25 18:54:39,090 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-25 18:54:59,927 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-25 18:55:02,088 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-25 18:55:11,079 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-25 18:55:12,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:55:14,246 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-25 18:55:27,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:55:38,372 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-25 18:55:39,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:55:42,187 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-25 18:55:44,201 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-25 18:55:56,837 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-25 18:56:08,222 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-25 18:56:30,933 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-25 18:56:32,988 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-25 18:56:35,153 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-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:56:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-25 18:56:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:56:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:56:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:56:35,551 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-25 18:56:35,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:56:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 613601222, now seen corresponding path program 1 times [2022-11-25 18:56:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:56:35,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109538880] [2022-11-25 18:56:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:56:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:56:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:56:37,528 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-25 18:56:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:56:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109538880] [2022-11-25 18:56:37,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109538880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:56:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854216056] [2022-11-25 18:56:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:56:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:56:37,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:56:37,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:56:37,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:56:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:56:37,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:56:37,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:56:38,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:56:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:56:39,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:56:39,338 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:56:39,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:56:39,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:56:39,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:56:39,474 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-25 18:56:39,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:56:40,015 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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_612) .cse1)))))) is different from false [2022-11-25 18:56:40,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:56:40,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-11-25 18:56:40,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:56:40,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-11-25 18:56:40,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-11-25 18:56:40,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:56:40,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:56:40,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-11-25 18:56:40,758 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-25 18:56:40,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854216056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:56:40,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:56:40,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 41 [2022-11-25 18:56:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110385908] [2022-11-25 18:56:40,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:56:40,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 18:56:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:56:40,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 18:56:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1386, Unknown=1, NotChecked=76, Total=1640 [2022-11-25 18:56:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:40,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:56:40,762 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-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:56:40,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:56:40,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:44,408 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-25 18:56:46,478 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-25 18:56:54,483 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-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:57:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:57:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:57:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:57:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 18:57:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:57:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:57:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:57:02,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:57:03,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:57:03,161 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-25 18:57:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:57:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1439309226, now seen corresponding path program 1 times [2022-11-25 18:57:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:57:03,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67493990] [2022-11-25 18:57:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:57:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:57:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:57:04,667 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-25 18:57:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:57:04,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67493990] [2022-11-25 18:57:04,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67493990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:57:04,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548120628] [2022-11-25 18:57:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:57:04,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:57:04,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:57:04,675 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:57:04,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:57:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:57:04,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 18:57:04,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:57:05,027 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:57:05,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:57:05,091 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:57:05,091 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-25 18:57:05,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:57:05,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:57:05,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:57:06,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:57:06,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:57:06,698 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:57:06,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:57:06,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:57:06,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:57:07,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 18:57:07,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:57:07,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:57:07,715 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:57:07,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:57:07,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-25 18:57:07,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:57:07,862 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-25 18:57:07,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:57:08,580 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (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-25 18:57:08,623 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (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-25 18:57:08,643 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= 400 (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-25 18:57:08,725 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= 400 (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-25 18:57:08,811 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |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| 1604))) (or (not (= 400 (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-25 18:57:08,847 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (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 .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_703))) (store (store .cse2 (+ 1608 |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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= 400 (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_52| (select .cse4 .cse3)))))) is different from false [2022-11-25 18:57:08,901 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| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_703))) (store (store .cse4 (+ 1608 |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| 1604))) (or (not (= 400 (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 .cse3))))))) is different from false [2022-11-25 18:57:09,750 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| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| 4) |c_~#queue~0.offset|) v_ArrVal_703))) (store (store .cse4 (+ 1608 |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_49| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| (select .cse2 .cse1))) (not (= 400 (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-25 18:57:10,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:57:10,440 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-25 18:57:10,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:57:10,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1141 treesize of output 1131 [2022-11-25 18:57:10,482 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 1069 treesize of output 1005 [2022-11-25 18:57:10,497 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 1259 treesize of output 1211 [2022-11-25 18:57:10,513 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 1235 treesize of output 1211 [2022-11-25 18:57:10,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:57:11,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:57:11,315 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-25 18:57:12,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:57:12,065 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-25 18:57:12,527 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-25 18:57:12,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548120628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:57:12,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:57:12,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 27] total 64 [2022-11-25 18:57:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985265006] [2022-11-25 18:57:12,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:57:12,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 18:57:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:57:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 18:57:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2714, Unknown=43, NotChecked=920, Total=4032 [2022-11-25 18:57:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:57:12,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:57:12,533 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-25 18:57:12,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:57:12,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:57:12,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:57:12,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:58:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:58:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:58:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:58:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:58:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:58:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:58:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:58:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:58:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:58:40,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:58:40,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:58:40,223 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-25 18:58:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:58:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1229645602, now seen corresponding path program 1 times [2022-11-25 18:58:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:58:40,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644765988] [2022-11-25 18:58:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:58:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:58:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:58:41,443 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-25 18:58:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:58:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644765988] [2022-11-25 18:58:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644765988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:58:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129906910] [2022-11-25 18:58:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:58:41,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:58:41,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:58:41,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:58:41,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:58:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:58:41,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 18:58:41,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:58:41,826 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:58:41,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:58:41,902 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:58:41,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:58:42,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:58:42,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:58:42,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:58:43,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:58:43,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:58:43,518 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:58:43,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:58:43,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:43,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:58:43,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 18:58:44,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:44,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:58:44,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:58:44,611 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:58:44,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:58:44,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:44,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:58:45,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 18:58:45,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:58:45,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:58:45,652 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:58:45,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:58:45,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:58:45,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:58:45,880 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-25 18:58:45,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:58:46,696 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (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-25 18:58:46,741 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (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-25 18:58:46,969 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |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| 1604))) (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-25 18:58:47,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (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 .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_808))) (store (store .cse2 (+ 1608 |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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< 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_59| (select .cse4 .cse3)))))) is different from false [2022-11-25 18:58:47,347 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| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4)) v_ArrVal_808))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_810) .cse3 (+ 1 (select .cse4 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (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-25 18:58:47,794 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| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 1608 |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-25 18:58:48,801 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |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| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 1608 |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 (+ (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))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse1)))))))) is different from false [2022-11-25 18:58:48,967 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |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| 1604)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 1608 |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_59| (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))))))) is different from false [2022-11-25 18:58:49,011 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (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 (+ 1608 |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| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 1608 |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 (+ (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_59| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| (select .cse7 .cse6)))))) is different from false [2022-11-25 18:58:49,086 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 ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| 4)) v_ArrVal_801))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_804) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_810) .cse3 (+ (select .cse6 .cse3) 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_59| (select .cse2 .cse3))) (< 0 (+ 2147483650 (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse4 .cse3))))))))) is different from false [2022-11-25 18:58:50,430 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 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.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 (+ 2147483650 (select (store .cse2 (+ (* |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 .cse3 .cse1)))))))))) is different from false [2022-11-25 18:58:51,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:51,568 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-25 18:58:51,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:51,600 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-25 18:58:51,621 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-25 18:58:51,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1197 treesize of output 1181 [2022-11-25 18:58:51,671 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 1608 treesize of output 1576 [2022-11-25 18:58:51,695 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 1658 treesize of output 1610 [2022-11-25 18:58:51,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:58:53,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:53,661 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 1147 treesize of output 1135 [2022-11-25 18:58:58,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:58:58,645 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-25 18:58:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 49 not checked. [2022-11-25 18:58:59,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129906910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:58:59,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:58:59,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31, 36] total 80 [2022-11-25 18:58:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921233612] [2022-11-25 18:58:59,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:58:59,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-25 18:58:59,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:58:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-25 18:58:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=4239, Unknown=84, NotChecked=1606, Total=6480 [2022-11-25 18:58:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:58:59,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:58:59,020 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-25 18:58:59,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:58:59,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:58:59,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:58:59,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:58:59,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:58:59,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-25 18:58:59,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:59:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:59:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:59:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:59:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:59:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 18:59:26,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:59:26,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:59:26,463 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-25 18:59:26,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:59:26,463 INFO L85 PathProgramCache]: Analyzing trace with hash -946567866, now seen corresponding path program 2 times [2022-11-25 18:59:26,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:59:26,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862566516] [2022-11-25 18:59:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:59:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:59:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:59:34,808 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-25 18:59:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:59:34,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862566516] [2022-11-25 18:59:34,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862566516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:59:34,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298171183] [2022-11-25 18:59:34,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:59:34,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:59:34,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:59:34,811 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:59:34,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec1d6cb4-f2c4-4c44-a8b5-dc7af14647f0/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:59:35,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:59:35,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:59:35,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-25 18:59:35,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:59:35,255 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:59:35,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:59:35,346 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:59:35,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 18:59:35,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:59:35,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:59:36,502 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-25 18:59:36,840 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-25 18:59:37,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:59:37,596 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-25 18:59:37,596 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-25 18:59:38,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:38,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:59:38,067 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-25 18:59:38,671 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-25 18:59:38,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:38,907 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-25 18:59:39,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:59:39,600 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-25 18:59:39,600 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-25 18:59:40,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:40,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:59:40,074 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-25 18:59:40,738 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-25 18:59:40,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:40,936 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-25 18:59:41,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:59:41,596 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:59:41,596 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-25 18:59:42,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:42,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:59:42,095 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-25 18:59:42,844 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-25 18:59:43,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:59:43,075 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-25 18:59:43,540 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:59:43,540 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-25 18:59:43,608 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-25 18:59:43,617 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-25 18:59:43,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:59:44,414 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-25 18:59:44,605 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (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| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-11-25 18:59:44,783 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (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 ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_935) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 18:59:45,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_935) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_935)))) (= 400 .cse4)))) is different from false [2022-11-25 18:59:45,063 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 ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_933)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse1 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_935) .cse3 (+ .cse4 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| 1604)))) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse4) (< (+ (select .cse1 .cse2) 1) v_ArrVal_935))))) is different from false [2022-11-25 18:59:45,091 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 ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_933)))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse1 .cse3))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_935) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_935) (= 400 .cse4)))))) is different from false [2022-11-25 18:59:45,139 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| 1604))) (let ((.cse2 (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 ((.cse0 (select .cse2 .cse4)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (= 400 .cse0) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~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| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_935)))))) is different from false [2022-11-25 18:59:50,174 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 ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.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 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_939)) .cse1) 2147483647)))))) is different from false [2022-11-25 18:59:50,239 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 ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.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 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_939)) .cse1) 2147483647)))))) is different from false [2022-11-25 18:59:50,267 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| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 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 (+ 1608 |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) (= 400 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))) is different from false [2022-11-25 18:59:50,314 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (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| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 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 (+ 1608 |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) (= 400 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935))))))) is different from false [2022-11-25 18:59:50,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse7 .cse8))) (or (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| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .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 ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 1608 |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) (= 400 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))) (= 400 .cse9)))) is different from false [2022-11-25 18:59:50,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (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 ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_927) .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= .cse2 400) (not (<= v_ArrVal_927 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.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 .cse4) 4)) v_ArrVal_939)) .cse1) 2147483647)))))) (= 400 .cse9)))) is different from false [2022-11-25 18:59:50,545 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse8 .cse9))) (or (= 400 .cse0) (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 ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_927) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse1 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse3 (select .cse1 .cse5)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_927) (< (+ (select .cse1 .cse2) 1) v_ArrVal_935) (= .cse3 400) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 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)) .cse2) 2147483647))))))))) is different from false [2022-11-25 18:59:50,586 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse1 .cse10))) (or (= 400 .cse0) (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 ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_927) .cse10 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse7)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_927) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (= .cse5 400) (< (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_939)) .cse4) 2147483647)))))))))) is different from false [2022-11-25 18:59:50,671 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 ((.cse7 (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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (select .cse7 .cse10))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_927) .cse10 (+ .cse6 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)) (.cse4 (+ 1608 |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| (* 4 (select .cse0 .cse1))) v_ArrVal_939)) .cse4) 2147483647) (= .cse5 400) (= 400 .cse6) (< (+ (select .cse7 .cse8) 1) v_ArrVal_927) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))))) is different from false [2022-11-25 18:59:50,740 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_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 ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_925))) (let ((.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select .cse9 .cse1))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_927) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse7 (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse3 (select .cse7 .cse5)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (or (= 400 .cse2) (= 400 .cse3) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_935) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse8) 2147483647) (< (+ (select .cse9 .cse10) 1) v_ArrVal_927) (< (+ (select .cse7 .cse8) 1) v_ArrVal_935))))))))))) is different from false [2022-11-25 18:59:50,850 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 ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4)) v_ArrVal_925)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse3 (select .cse6 .cse5))) (let ((.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 .cse7 v_ArrVal_927) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse9))) v_ArrVal_933)))) (let ((.cse2 (select .cse0 .cse9)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= 400 .cse2) (= 400 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse4 .cse5))) (< (+ 1 (select .cse6 .cse7)) v_ArrVal_927) (< (select (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_935) .cse9 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_ArrVal_939)) .cse1) 2147483647))))))))) is different from false [2022-11-25 18:59:54,096 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_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int)) (let ((.cse10 (store |c_#memory_int| |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| 1604))) (let ((.cse4 (+ 1608 |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 (+ (* (select .cse9 .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 .cse4) 1) v_ArrVal_927) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse1))) (= 400 .cse5) (= 400 .cse8)))))))))) is different from false [2022-11-25 18:59:54,461 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse8 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_927) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.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 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse1) 2147483647) (= 400 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse3))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_927) (not (<= v_ArrVal_923 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (= 400 .cse5)))))))))) is different from false [2022-11-25 18:59:54,639 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse8 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_927) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse5 (select .cse0 .cse3))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_923) (< (+ (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 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse1) 2147483647) (= 400 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse3))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_927) (= 400 .cse5)))))))))) is different from false [2022-11-25 18:59:54,709 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 ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse1 v_ArrVal_927) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse11 (select .cse4 |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.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 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse1) 2147483647) (= 400 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse3))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_923) (< (+ (select .cse10 .cse1) 1) v_ArrVal_927) (= 400 .cse5))))))))))) is different from false [2022-11-25 18:59:55,080 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 ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_921) .cse7 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse2 .cse1))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_927) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse5 (select .cse10 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_927) (= 400 .cse4) (= 400 .cse5) (not (<= v_ArrVal_921 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_923) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) v_ArrVal_939)) .cse3) 2147483647) (< (+ (select .cse10 .cse3) 1) v_ArrVal_935))))))))))) is different from false [2022-11-25 18:59:55,764 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 ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse11 v_ArrVal_921) .cse7 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse2 .cse1))) (let ((.cse9 (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_927) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse10 (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse5 (select .cse10 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_927) (= 400 .cse4) (= 400 .cse5) (< (+ (select .cse6 .cse7) 1) v_ArrVal_923) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) v_ArrVal_939)) .cse3) 2147483647) (< (+ (select .cse6 .cse11) 1) v_ArrVal_921) (< (+ (select .cse10 .cse3) 1) v_ArrVal_935))))))))))) is different from false [2022-11-25 18:59:55,934 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 ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_918)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_921) .cse11 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)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (select .cse9 .cse4))) (let ((.cse5 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_927) .cse4 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse6 (let ((.cse12 (select .cse5 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse0 (select .cse6 .cse4))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_921) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_935) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse7) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse8 .cse4))) (< (+ (select .cse9 .cse7) 1) v_ArrVal_927) (< (+ (select .cse6 .cse7) 1) v_ArrVal_935) (= 400 .cse10) (< (+ (select .cse1 .cse11) 1) v_ArrVal_923))))))))))) is different from false [2022-11-25 18:59:56,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse0 .cse1))) (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 ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_918)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_921) .cse1 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (let ((.cse4 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse4 .cse8))) (let ((.cse9 (store (store .cse14 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_927) .cse8 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse10 (let ((.cse13 (select .cse9 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse11 (select .cse10 .cse8))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_921) (< (+ (select .cse2 .cse1) 1) v_ArrVal_923) (< (+ (select .cse4 .cse5) 1) v_ArrVal_927) (= 400 .cse6) (< (select (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_935) .cse8 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse5) 2147483647) (< (+ (select .cse10 .cse5) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse12 .cse8))) (= 400 .cse11)))))))))))))) is different from false [2022-11-25 18:59:56,280 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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4)) v_ArrVal_918)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 .cse10 v_ArrVal_921) .cse1 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (let ((.cse9 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse11 (select .cse9 .cse4))) (let ((.cse5 (store (store .cse14 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_927) .cse4 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse6 (let ((.cse13 (select .cse5 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse8 (select .cse6 .cse4))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_923) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_935) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_939)) .cse7) 2147483647) (< (+ (select .cse9 .cse7) 1) v_ArrVal_927) (< (+ (select .cse2 .cse10) 1) v_ArrVal_921) (< (+ (select .cse6 .cse7) 1) v_ArrVal_935) (= 400 .cse11) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse12 .cse4))) (= 400 .cse8)))))))))))) is different from false [2022-11-25 19:00:22,767 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 ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_~#queue~0.offset|) v_ArrVal_918)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_921) .cse5 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925))) (let ((.cse2 (select .cse0 .cse5))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_927) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse6 (select .cse3 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_927) (= 400 .cse2) (< (+ (select .cse3 .cse1) 1) v_ArrVal_935) (< (+ (select .cse4 .cse5) 1) v_ArrVal_923) (= 400 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse7 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse8 .cse5))) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_935) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse1) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_921))))))))))))) is different from false [2022-11-25 19:00:24,905 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_915 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 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_~#queue~0.offset|) v_ArrVal_918)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_921) .cse1 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925))) (let ((.cse5 (select .cse2 .cse1))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_927) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse8 (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_933)))) (let ((.cse4 (select .cse8 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_927) (= 400 .cse4) (= 400 .cse5) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_935) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse3) 2147483647) (< (+ (select .cse8 .cse3) 1) v_ArrVal_935) (not (<= v_ArrVal_915 0)) (< (+ (select .cse9 .cse1) 1) v_ArrVal_923) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse10 .cse1))) (< (+ (select .cse9 .cse3) 1) v_ArrVal_921))))))))))))) is different from false [2022-11-25 19:00:24,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 19:00:24,954 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-25 19:00:25,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 19:00:25,025 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-25 19:00:25,073 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 5216 treesize of output 5192 [2022-11-25 19:00:25,155 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 2370 treesize of output 2358 [2022-11-25 19:00:25,214 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 2731 treesize of output 2539 [2022-11-25 19:00:25,269 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 4240 treesize of output 3984 [2022-11-25 19:00:25,335 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 4792 treesize of output 4600 [2022-11-25 19:00:25,602 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 17 treesize of output 9 [2022-11-25 19:00:30,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 19:00:30,465 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 1731 treesize of output 1747 [2022-11-25 19:01:09,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 19:01:09,606 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-25 19:01:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 54 refuted. 8 times theorem prover too weak. 0 trivial. 112 not checked. [2022-11-25 19:01:09,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298171183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 19:01:09,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 19:01:09,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 55] total 146 [2022-11-25 19:01:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084969544] [2022-11-25 19:01:09,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 19:01:09,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2022-11-25 19:01:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 19:01:09,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2022-11-25 19:01:09,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1796, Invalid=12009, Unknown=117, NotChecked=7540, Total=21462 [2022-11-25 19:01:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 19:01:09,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 19:01:09,861 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-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-25 19:01:09,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-25 19:01:09,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-25 19:01:09,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 19:01:09,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-25 19:01:09,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 19:02:55,009 WARN L233 SmtUtils]: Spent 17.91s on a formula simplification. DAG size of input: 392 DAG size of output: 257 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:02:57,020 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-25 19:03:13,780 WARN L233 SmtUtils]: Spent 9.68s on a formula simplification. DAG size of input: 330 DAG size of output: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:03:15,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 19:03:27,538 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 327 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:03:48,628 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 385 DAG size of output: 331 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:04:49,861 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 395 DAG size of output: 370 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 19:05:11,210 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-25 19:05:19,582 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]