./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 09:31:28,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:31:28,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:31:28,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:31:28,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:31:28,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:31:28,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:31:28,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:31:28,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:31:28,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:31:28,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:31:28,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:31:28,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:31:28,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:31:28,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:31:28,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:31:28,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:31:28,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:31:28,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:31:28,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:31:28,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:31:28,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:31:28,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:31:28,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:31:28,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:31:28,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:31:28,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:31:28,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:31:28,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:31:28,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:31:28,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:31:28,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:31:28,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:31:28,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:31:28,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:31:28,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:31:28,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:31:28,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:31:28,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:31:28,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:31:28,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:31:28,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-12-13 09:31:28,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:31:28,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:31:28,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 09:31:28,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 09:31:28,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 09:31:28,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 09:31:28,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:31:28,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:31:28,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:31:28,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:31:28,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:28,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 09:31:28,146 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 09:31:28,147 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_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-12-13 09:31:28,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:31:28,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:31:28,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:31:28,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:31:28,330 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:31:28,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 09:31:30,881 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:31:31,105 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:31:31,106 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 09:31:31,118 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/data/2323233f9/95f66d45568d4097848769e5bf9c137e/FLAG6bb07abd4 [2022-12-13 09:31:31,133 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/data/2323233f9/95f66d45568d4097848769e5bf9c137e [2022-12-13 09:31:31,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:31:31,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 09:31:31,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:31,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:31:31,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:31:31,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff75db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31, skipping insertion in model container [2022-12-13 09:31:31,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:31:31,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:31:31,651 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_bc7f4acd-278b-4127-bc02-f1d320a80762/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 09:31:31,654 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_bc7f4acd-278b-4127-bc02-f1d320a80762/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 09:31:31,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:31,669 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:31:31,705 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_bc7f4acd-278b-4127-bc02-f1d320a80762/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 09:31:31,707 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_bc7f4acd-278b-4127-bc02-f1d320a80762/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 09:31:31,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:31,744 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:31:31,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31 WrapperNode [2022-12-13 09:31:31,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:31,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:31,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:31:31,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:31:31,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,781 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-13 09:31:31,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:31,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:31:31,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:31:31,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:31:31,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,803 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:31:31,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:31:31,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:31:31,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:31:31,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (1/1) ... [2022-12-13 09:31:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:31:31,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:31:31,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:31:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 09:31:31,870 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 09:31:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 09:31:31,871 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:31:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:31:31,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:31:31,873 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 09:31:31,983 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 09:31:31,984 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:31:32,250 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 09:31:32,260 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:31:32,261 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 09:31:32,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:32 BoogieIcfgContainer [2022-12-13 09:31:32,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:31:32,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:31:32,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:31:32,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:31:32,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:31:31" (1/3) ... [2022-12-13 09:31:32,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b8cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:32, skipping insertion in model container [2022-12-13 09:31:32,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:31" (2/3) ... [2022-12-13 09:31:32,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b8cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:32, skipping insertion in model container [2022-12-13 09:31:32,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:32" (3/3) ... [2022-12-13 09:31:32,271 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-13 09:31:32,280 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 09:31:32,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:31:32,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-13 09:31:32,290 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:31:32,357 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 09:31:32,391 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:31:32,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:31:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:31:32,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:31:32,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 09:31:32,425 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:31:32,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-12-13 09:31:32,439 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;@4e96293c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:31:32,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:31:32,678 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-12-13 09:31:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1146083099, now seen corresponding path program 1 times [2022-12-13 09:31:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:32,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143419990] [2022-12-13 09:31:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143419990] [2022-12-13 09:31:32,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143419990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:32,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823226284] [2022-12-13 09:31:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:32,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:31:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:31:32,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:31:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:32,895 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:32,896 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-12-13 09:31:32,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:32,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:31:32,929 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-12-13 09:31:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1396834243, now seen corresponding path program 1 times [2022-12-13 09:31:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:32,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584831558] [2022-12-13 09:31:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:33,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584831558] [2022-12-13 09:31:33,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584831558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:33,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:33,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:33,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127184898] [2022-12-13 09:31:33,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:33,166 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:33,167 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-12-13 09:31:33,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:33,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:33,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:31:33,225 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-12-13 09:31:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash -984595744, now seen corresponding path program 1 times [2022-12-13 09:31:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:33,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33192934] [2022-12-13 09:31:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:34,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33192934] [2022-12-13 09:31:34,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33192934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:34,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:34,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-12-13 09:31:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823618900] [2022-12-13 09:31:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:34,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 09:31:34,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 09:31:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-12-13 09:31:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:34,923 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:34,923 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-12-13 09:31:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:36,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:31:36,106 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-12-13 09:31:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -457696371, now seen corresponding path program 1 times [2022-12-13 09:31:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:36,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256347065] [2022-12-13 09:31:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256347065] [2022-12-13 09:31:37,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256347065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:37,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:37,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-13 09:31:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733463966] [2022-12-13 09:31:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:31:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:31:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:31:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:37,753 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:37,753 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-12-13 09:31:37,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:37,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:37,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:37,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:38,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:38,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:31:38,682 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-12-13 09:31:38,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash -280964946, now seen corresponding path program 1 times [2022-12-13 09:31:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:38,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183657456] [2022-12-13 09:31:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183657456] [2022-12-13 09:31:38,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183657456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:38,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:38,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679336325] [2022-12-13 09:31:38,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:38,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:38,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:38,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:38,774 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-12-13 09:31:38,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:38,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:38,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:38,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:38,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:38,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:31:38,862 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-12-13 09:31:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash 550401898, now seen corresponding path program 1 times [2022-12-13 09:31:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:38,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035472076] [2022-12-13 09:31:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035472076] [2022-12-13 09:31:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035472076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:31:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44167791] [2022-12-13 09:31:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:39,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:31:39,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:31:39,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 09:31:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:39,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 09:31:39,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:31:40,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:31:40,176 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-12-13 09:31:40,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:31:40,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-12-13 09:31:40,461 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 09:31:40,462 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-12-13 09:31:40,488 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-12-13 09:31:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:40,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:31:41,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:41,156 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-12-13 09:31:41,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:41,166 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-12-13 09:31:41,173 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-12-13 09:31:41,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 09:31:41,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:41,238 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-12-13 09:31:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:41,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44167791] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:31:41,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:31:41,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 41 [2022-12-13 09:31:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128176709] [2022-12-13 09:31:41,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:31:41,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-13 09:31:41,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-13 09:31:41,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1509, Unknown=18, NotChecked=0, Total=1722 [2022-12-13 09:31:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:41,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:41,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 8.609756097560975) internal successors, (353), 42 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:41,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:41,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:41,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:41,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:41,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:41,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:42,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 09:31:42,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:42,911 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-12-13 09:31:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -117409725, now seen corresponding path program 1 times [2022-12-13 09:31:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558816327] [2022-12-13 09:31:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:43,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558816327] [2022-12-13 09:31:43,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558816327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:43,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:43,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-13 09:31:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525012620] [2022-12-13 09:31:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:43,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 09:31:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:43,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 09:31:43,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-12-13 09:31:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:43,935 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:43,936 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-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:43,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:31:44,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:31:44,631 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-12-13 09:31:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2142514423, now seen corresponding path program 1 times [2022-12-13 09:31:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:44,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21556161] [2022-12-13 09:31:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:48,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21556161] [2022-12-13 09:31:48,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21556161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:48,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-12-13 09:31:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287643268] [2022-12-13 09:31:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:48,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 09:31:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 09:31:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-12-13 09:31:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:48,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:48,593 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-12-13 09:31:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:48,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:48,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:31:48,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:31:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:31:50,486 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-12-13 09:31:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1993437034, now seen corresponding path program 1 times [2022-12-13 09:31:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466658766] [2022-12-13 09:31:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:53,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466658766] [2022-12-13 09:31:53,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466658766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:53,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:53,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-13 09:31:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450082013] [2022-12-13 09:31:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 09:31:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 09:31:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-13 09:31:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:53,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:53,530 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-12-13 09:31:53,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:53,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:53,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:53,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:53,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:53,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:53,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:31:53,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:53,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:31:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:54,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:31:54,623 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-12-13 09:31:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1423858270, now seen corresponding path program 1 times [2022-12-13 09:31:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:54,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316908383] [2022-12-13 09:31:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316908383] [2022-12-13 09:31:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316908383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:31:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277632208] [2022-12-13 09:31:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:31:55,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:31:55,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 09:31:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:55,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 09:31:55,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:31:55,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:31:55,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 24 [2022-12-13 09:31:56,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:31:56,039 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-12-13 09:31:56,277 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 09:31:56,277 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-12-13 09:31:56,321 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-12-13 09:31:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:56,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:31:56,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:56,956 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-12-13 09:31:56,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:56,964 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-12-13 09:31:56,970 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-12-13 09:31:56,985 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-12-13 09:31:56,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:56,991 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-12-13 09:31:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277632208] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:31:57,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:31:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-12-13 09:31:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943560860] [2022-12-13 09:31:57,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:31:57,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 09:31:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:57,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 09:31:57,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2378, Unknown=15, NotChecked=0, Total=2652 [2022-12-13 09:31:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:57,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:57,217 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-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:57,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:31:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:31:58,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 09:31:58,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:58,713 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-12-13 09:31:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1189932789, now seen corresponding path program 1 times [2022-12-13 09:31:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:58,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222835925] [2022-12-13 09:31:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:00,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222835925] [2022-12-13 09:32:00,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222835925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:32:00,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409241561] [2022-12-13 09:32:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:00,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:32:00,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:32:00,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:32:00,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 09:32:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:00,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-13 09:32:00,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:32:01,023 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:32:01,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:32:01,063 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:32:01,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 09:32:01,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:32:01,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-12-13 09:32:01,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:32:01,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:32:02,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:32:02,194 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 09:32:02,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 09:32:02,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:32:02,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:32:02,366 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-12-13 09:32:02,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 09:32:02,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:32:02,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:32:02,880 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 09:32:02,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 09:32:02,914 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-12-13 09:32:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:02,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:32:03,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_404 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-13 09:32:03,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_402) .cse2 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_404) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_402 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-12-13 09:32:06,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_402) .cse3 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_402) (< (+ (select .cse1 .cse3) 1) v_ArrVal_404) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-13 09:32:06,079 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 ((.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_400)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_402) .cse3 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_402) (< (+ (select .cse1 .cse3) 1) v_ArrVal_404))))) is different from false [2022-12-13 09:32:06,112 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (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 .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (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| 3204)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse4 .cse1)))))) is different from false [2022-12-13 09:32:06,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_400 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse4 v_ArrVal_402) .cse1 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_404) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_402)))))) is different from false [2022-12-13 09:32:15,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_400 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_402) .cse1 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_402) (< (+ (select .cse3 .cse1) 1) v_ArrVal_404) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) .cse4) 2147483647))))))) is different from false [2022-12-13 09:32:16,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_400 Int) (v_ArrVal_396 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_396)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_399))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_402) .cse1 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= v_ArrVal_396 0)) (< (+ (select .cse4 .cse3) 1) v_ArrVal_402) (< (+ (select .cse4 .cse1) 1) v_ArrVal_404))))))) is different from false [2022-12-13 09:32:16,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:16,502 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-12-13 09:32:16,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:16,517 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-12-13 09:32:16,528 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-12-13 09:32:16,542 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-12-13 09:32:16,560 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-12-13 09:32:16,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:16,635 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-12-13 09:32:17,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:17,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 109 [2022-12-13 09:32:17,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:17,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-12-13 09:32:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-13 09:32:18,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409241561] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:32:18,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:32:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-12-13 09:32:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393991630] [2022-12-13 09:32:18,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:32:18,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-13 09:32:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-13 09:32:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=4907, Unknown=52, NotChecked=1224, Total=6806 [2022-12-13 09:32:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:18,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:32:18,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 4.548780487804878) internal successors, (373), 83 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:18,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:18,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:18,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:18,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:18,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:18,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:18,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-12-13 09:32:18,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:32:18,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:18,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:18,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:36,667 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 160 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:32:38,733 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-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:32:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:32:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 09:32:51,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 09:32:51,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:32:51,408 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-12-13 09:32:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 986214256, now seen corresponding path program 1 times [2022-12-13 09:32:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:51,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169124006] [2022-12-13 09:32:51,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:51,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:51,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169124006] [2022-12-13 09:32:51,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169124006] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:32:51,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867364274] [2022-12-13 09:32:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:51,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:32:51,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:32:51,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:32:51,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 09:32:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:51,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 09:32:51,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:32:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:51,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:32:51,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867364274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:51,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:32:51,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-13 09:32:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117784384] [2022-12-13 09:32:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:51,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 09:32:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:51,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:32:51,673 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-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:51,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:32:51,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:51,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:32:51,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-12-13 09:32:51,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 09:32:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:51,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 09:32:51,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 09:32:51,920 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-12-13 09:32:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 507871514, now seen corresponding path program 1 times [2022-12-13 09:32:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:51,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222680571] [2022-12-13 09:32:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 09:32:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:52,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222680571] [2022-12-13 09:32:52,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222680571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:52,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:52,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482127839] [2022-12-13 09:32:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:52,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:52,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:52,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:52,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:32:52,023 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-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:52,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-12-13 09:32:52,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-12-13 09:32:52,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:52,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:32:52,582 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-12-13 09:32:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash 779559429, now seen corresponding path program 1 times [2022-12-13 09:32:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149649311] [2022-12-13 09:32:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:54,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149649311] [2022-12-13 09:32:54,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149649311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:32:54,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163380356] [2022-12-13 09:32:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:32:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:32:54,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:32:54,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 09:32:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:54,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-13 09:32:54,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:32:54,472 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:32:54,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:32:54,511 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:32:54,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 09:32:54,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:32:54,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:32:55,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:32:55,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:32:55,288 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-12-13 09:32:55,288 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 2 case distinctions, treesize of input 34 treesize of output 52 [2022-12-13 09:32:55,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:32:55,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-12-13 09:32:56,044 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 51 treesize of output 32 [2022-12-13 09:32:56,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:32:56,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-12-13 09:32:56,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:32:56,621 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-12-13 09:32:56,621 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 51 treesize of output 50 [2022-12-13 09:32:56,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:32:56,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:32:56,976 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 69 treesize of output 44 [2022-12-13 09:32:57,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-12-13 09:32:57,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:32:57,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:32:57,670 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 09:32:57,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 09:32:57,720 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-12-13 09:32:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:57,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:33:00,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_607) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_609 1)) (< 800 (select .cse0 .cse1)) (< (+ (select .cse0 .cse2) 1) v_ArrVal_607) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse3 .cse1))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse2) 2147483647)))))) is different from false [2022-12-13 09:33:00,575 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_607) .cse1 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (< 800 (select .cse2 .cse1)) (not (<= v_ArrVal_609 1)) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse3) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_607)))))) is different from false [2022-12-13 09:33:00,604 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_607) .cse3 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (not (<= v_ArrVal_609 1)) (< 800 (select .cse2 .cse3)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_607) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse3)))))))) is different from false [2022-12-13 09:33:00,657 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_607) .cse3 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (not (<= v_ArrVal_609 1)) (< 800 (select .cse2 .cse3)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_607) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse3)))))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2022-12-13 09:33:00,691 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_607) .cse3 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (not (<= v_ArrVal_609 1)) (< 800 (select .cse2 .cse3)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_607) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse3)))))))) (= .cse8 800)))) is different from false [2022-12-13 09:33:00,785 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_600) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_607) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse2))) (not (<= v_ArrVal_609 1)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_607) (not (<= v_ArrVal_600 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< 800 (select .cse3 .cse2))))))) (= .cse8 800)))) is different from false [2022-12-13 09:33:01,150 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse3 .cse8))) (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_600) .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_607) .cse2 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse2))) (not (<= v_ArrVal_609 1)) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_600) (< (+ (select .cse5 .cse1) 1) v_ArrVal_607) (< 800 (select .cse5 .cse2)))))))) (= .cse9 800)))) is different from false [2022-12-13 09:33:01,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (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_598)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (select .cse2 .cse9))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_600) .cse9 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_607) .cse5 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_607) (not (<= v_ArrVal_609 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_600) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse4 .cse5))) (= .cse6 800) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (< 800 (select .cse0 .cse5))))))))) is different from false [2022-12-13 09:33:01,296 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse0 .cse1))) (forall ((v_ArrVal_598 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_598))) (let ((.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (select .cse7 .cse1))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_600) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse2 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_607) .cse5 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_609 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_607) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse4 .cse5))) (< 800 (select .cse2 .cse5)) (= .cse6 800) (< (+ (select .cse7 .cse8) 1) v_ArrVal_600) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse3) 2147483647))))))))))) is different from false [2022-12-13 09:33:01,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_598)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse6 (select .cse7 .cse5))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_600) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse0 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse3)) |c_~#queue~0.offset|) v_ArrVal_605))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_607) .cse3 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_607) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 .cse3))) (not (<= v_ArrVal_609 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse4 .cse5))) (= 800 .cse6) (< 800 (select .cse0 .cse3)) (< (+ (select .cse7 .cse8) 1) v_ArrVal_600))))))))) is different from false [2022-12-13 09:33:05,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_612 Int) (v_ArrVal_600 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_597))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_598)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse2 .cse4))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_600) .cse4 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_605)))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_607) .cse4 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_600) (not (<= v_ArrVal_609 1)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_607) (< 800 (select .cse3 .cse4)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse4))) (= .cse6 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 .cse4)))))))))))) is different from false [2022-12-13 09:33:06,297 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| Int) (v_ArrVal_609 Int) (v_ArrVal_607 Int) (v_ArrVal_605 Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_612 Int) (v_ArrVal_600 Int) (v_ArrVal_598 Int) (v_ArrVal_611 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_597))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| 4) |c_~#queue~0.offset|) v_ArrVal_598)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse3 .cse4))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_600) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_604))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse4)) |c_~#queue~0.offset|) v_ArrVal_605)))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_607) .cse4 v_ArrVal_609)) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_607) (= 800 .cse2) (< (+ (select .cse3 .cse1) 1) v_ArrVal_600) (< 800 (select .cse0 .cse4)) (not (<= v_ArrVal_609 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_39| (select .cse5 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse6 .cse4))) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_612) .cse1) 2147483647)))))))))) is different from false [2022-12-13 09:33:07,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:07,238 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 1107 treesize of output 787 [2022-12-13 09:33:07,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:07,273 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 1960 treesize of output 1942 [2022-12-13 09:33:07,296 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 1020 treesize of output 956 [2022-12-13 09:33:07,327 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 918 treesize of output 886 [2022-12-13 09:33:07,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:07,359 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 1813 treesize of output 1749 [2022-12-13 09:33:07,388 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 1539 treesize of output 1443 [2022-12-13 09:33:07,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 09:33:14,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:14,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 934 treesize of output 888 [2022-12-13 09:33:15,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:15,973 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-12-13 09:33:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 36 refuted. 6 times theorem prover too weak. 0 trivial. 25 not checked. [2022-12-13 09:33:16,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163380356] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:33:16,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:33:16,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 39, 41] total 105 [2022-12-13 09:33:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506529823] [2022-12-13 09:33:16,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:33:16,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-12-13 09:33:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:16,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-12-13 09:33:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=7838, Unknown=102, NotChecked=2316, Total=10920 [2022-12-13 09:33:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:16,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:33:16,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 4.580952380952381) internal successors, (481), 105 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:33:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:16,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:37,584 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 178 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:33:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 09:33:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:33:38,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 09:33:38,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 09:33:38,317 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-12-13 09:33:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1989815115, now seen corresponding path program 1 times [2022-12-13 09:33:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:38,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157423438] [2022-12-13 09:33:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:33:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:38,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157423438] [2022-12-13 09:33:38,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157423438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:33:38,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348751962] [2022-12-13 09:33:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:38,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:33:38,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:33:38,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:33:38,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 09:33:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:38,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 09:33:38,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:33:39,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:33:39,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:39,345 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-12-13 09:33:39,550 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 09:33:39,550 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-12-13 09:33:39,614 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 25 treesize of output 24 [2022-12-13 09:33:39,631 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 21 treesize of output 9 [2022-12-13 09:33:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:33:39,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:33:40,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_681 Int) (v_ArrVal_680 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_680) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_681) (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_681 2147483648) 0))) is different from false [2022-12-13 09:33:40,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:40,068 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 31 treesize of output 32 [2022-12-13 09:33:40,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:40,075 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-12-13 09:33:40,080 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-12-13 09:33:40,092 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-12-13 09:33:40,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:40,102 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-12-13 09:33:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:33:40,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348751962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:33:40,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:33:40,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2022-12-13 09:33:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505715831] [2022-12-13 09:33:40,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:33:40,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 09:33:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 09:33:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1714, Unknown=1, NotChecked=84, Total=1980 [2022-12-13 09:33:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:40,376 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:33:40,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 9.113636363636363) internal successors, (401), 45 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:40,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:33:40,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:33:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:42,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 09:33:42,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 09:33:42,315 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-12-13 09:33:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1554727060, now seen corresponding path program 1 times [2022-12-13 09:33:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:42,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106445537] [2022-12-13 09:33:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:33:43,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:43,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106445537] [2022-12-13 09:33:43,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106445537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:33:43,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117537275] [2022-12-13 09:33:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:43,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:33:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:33:43,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:33:43,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 09:33:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:43,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 09:33:43,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:33:44,062 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:33:44,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:33:44,094 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:33:44,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 09:33:44,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:33:44,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:33:44,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:33:44,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:33:44,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:33:44,910 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:33:44,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:33:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:44,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:33:45,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 09:33:45,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:45,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:33:45,515 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:33:45,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 09:33:45,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:33:45,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 09:33:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:33:45,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:33:45,829 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_762 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_764)) .cse1)) 2147483647)) is different from false [2022-12-13 09:33:45,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_762 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse1)) 2147483647)) is different from false [2022-12-13 09:33:46,128 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_762 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_764)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-12-13 09:33:46,151 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_764 Int) (v_ArrVal_758 Int) (v_ArrVal_762 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_758) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-12-13 09:33:46,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (v_ArrVal_758 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int))) (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_757)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_758) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse1)) 2147483647) (= 800 .cse4))))) is different from false [2022-12-13 09:33:46,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse0 .cse1))) (forall ((v_ArrVal_764 Int) (v_ArrVal_758 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_757))) (let ((.cse5 (select .cse4 .cse1))) (or (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_758) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse3)) 2147483647) (= .cse5 800)))))))) is different from false [2022-12-13 09:33:46,242 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int) (v_ArrVal_758 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_757)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_758) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse1)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse5 .cse3))) (= .cse4 800)))))) is different from false [2022-12-13 09:33:46,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_764 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int) (v_ArrVal_758 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_755))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_~#queue~0.offset|) v_ArrVal_757)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse1) 2147483647) (= .cse4 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse5 .cse1))))))))) is different from false [2022-12-13 09:33:46,671 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_764 Int) (v_ArrVal_754 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| Int) (v_ArrVal_758 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_755))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| 4) |c_~#queue~0.offset|) v_ArrVal_757)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_758) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_762) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_764)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_53| (select .cse5 .cse2))))))))) is different from false [2022-12-13 09:33:47,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:47,181 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 297 treesize of output 197 [2022-12-13 09:33:47,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:47,197 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 533 treesize of output 529 [2022-12-13 09:33:47,206 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 422 treesize of output 374 [2022-12-13 09:33:47,212 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 561 treesize of output 521 [2022-12-13 09:33:47,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 308 [2022-12-13 09:33:47,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 09:33:47,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:47,263 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 317 treesize of output 301 [2022-12-13 09:33:49,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:49,667 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-12-13 09:33:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-12-13 09:33:49,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117537275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:33:49,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:33:49,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 29] total 76 [2022-12-13 09:33:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305959547] [2022-12-13 09:33:49,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:33:49,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-13 09:33:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-13 09:33:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=4002, Unknown=28, NotChecked=1260, Total=5852 [2022-12-13 09:33:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:49,765 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:33:49,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 5.302631578947368) internal successors, (403), 77 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:49,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:33:49,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:33:49,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:21,953 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-12-13 09:34:24,080 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-12-13 09:34:50,683 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 257 DAG size of output: 218 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:34:53,651 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-12-13 09:34:55,668 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-12-13 09:35:18,599 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-12-13 09:35:20,621 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-12-13 09:35:38,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:35:40,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:35:42,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:35:44,665 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-12-13 09:35:46,686 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-12-13 09:36:17,104 WARN L233 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 262 DAG size of output: 228 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:36:19,732 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-12-13 09:36:21,743 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-12-13 09:36:23,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:36:25,768 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-12-13 09:36:27,984 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-12-13 09:36:30,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:36:32,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:36:34,207 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-12-13 09:36:49,753 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-12-13 09:36:52,136 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-12-13 09:36:54,294 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-12-13 09:37:15,804 WARN L233 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 126 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:37:17,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:37:19,951 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-12-13 09:38:00,523 WARN L233 SmtUtils]: Spent 33.92s on a formula simplification. DAG size of input: 138 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:38:04,699 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-12-13 09:38:42,585 WARN L233 SmtUtils]: Spent 29.50s on a formula simplification. DAG size of input: 135 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:38:44,780 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-12-13 09:39:11,818 WARN L233 SmtUtils]: Spent 16.26s on a formula simplification. DAG size of input: 146 DAG size of output: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:39:13,877 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-12-13 09:40:01,661 WARN L233 SmtUtils]: Spent 36.77s on a formula simplification. DAG size of input: 140 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:40:04,126 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-12-13 09:40:06,139 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-12-13 09:40:16,611 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 148 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 09:40:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:40:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 09:40:49,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 09:40:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 09:40:49,203 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-12-13 09:40:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:40:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 172696973, now seen corresponding path program 2 times [2022-12-13 09:40:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:40:49,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826961782] [2022-12-13 09:40:49,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:40:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:40:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:40:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 147 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 09:40:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:40:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826961782] [2022-12-13 09:40:50,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826961782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:40:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020627202] [2022-12-13 09:40:50,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:40:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:40:50,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:40:50,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:40:50,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 09:40:50,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:40:50,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:40:50,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 09:40:50,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:40:51,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:40:51,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:40:51,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:40:51,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:40:51,466 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:40:51,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:40:51,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:40:51,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:40:51,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 09:40:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 147 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 09:40:51,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:40:51,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (v_ArrVal_879 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_877) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| 4) |c_~#queue~0.offset|) v_ArrVal_879) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_60| (select .cse0 .cse1)))))) is different from false [2022-12-13 09:40:51,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:40:51,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-12-13 09:40:51,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:40:51,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-12-13 09:40:51,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-12-13 09:40:51,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 09:40:51,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:40:51,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2022-12-13 09:40:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 135 proven. 76 refuted. 0 times theorem prover too weak. 53 trivial. 12 not checked. [2022-12-13 09:40:52,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020627202] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:40:52,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:40:52,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 36 [2022-12-13 09:40:52,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270600252] [2022-12-13 09:40:52,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:40:52,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 09:40:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:40:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 09:40:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1044, Unknown=1, NotChecked=66, Total=1260 [2022-12-13 09:40:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:52,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:40:52,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 14.194444444444445) internal successors, (511), 36 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-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-12-13 09:40:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:40:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:40:53,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 09:40:53,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 09:40:53,651 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-12-13 09:40:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:40:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1503030260, now seen corresponding path program 1 times [2022-12-13 09:40:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:40:53,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657110762] [2022-12-13 09:40:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:40:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:40:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:40:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 44 proven. 86 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 09:40:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:40:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657110762] [2022-12-13 09:40:54,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657110762] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:40:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014237863] [2022-12-13 09:40:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:40:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:40:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:40:54,256 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:40:54,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 09:40:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:40:54,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 09:40:54,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:40:55,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:40:55,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:40:55,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:40:55,379 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:40:55,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:40:55,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:40:55,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 09:40:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 44 proven. 86 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 09:40:55,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:40:55,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:40:55,903 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 53 treesize of output 43 [2022-12-13 09:40:55,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:40:55,912 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 78 treesize of output 80 [2022-12-13 09:40:55,918 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 55 treesize of output 47 [2022-12-13 09:40:55,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 09:40:55,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:40:55,963 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 50 treesize of output 46 [2022-12-13 09:40:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 44 proven. 86 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-13 09:40:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014237863] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:40:56,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:40:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 37 [2022-12-13 09:40:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22841205] [2022-12-13 09:40:56,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:40:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 09:40:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:40:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 09:40:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1246, Unknown=5, NotChecked=0, Total=1406 [2022-12-13 09:40:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:56,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:40:56,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 13.405405405405405) internal successors, (496), 38 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:40:56,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:40:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 09:40:57,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 09:40:57,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 09:40:57,957 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-12-13 09:40:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:40:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash 192224981, now seen corresponding path program 3 times [2022-12-13 09:40:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:40:57,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319517614] [2022-12-13 09:40:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:40:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:40:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:41:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 177 proven. 85 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 09:41:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:41:01,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319517614] [2022-12-13 09:41:01,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319517614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:41:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846982572] [2022-12-13 09:41:01,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 09:41:01,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:41:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:41:01,082 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:41:01,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc7f4acd-278b-4127-bc02-f1d320a80762/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 09:41:01,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 09:41:01,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:41:01,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 122 conjunts are in the unsatisfiable core [2022-12-13 09:41:01,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:41:01,696 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:41:01,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:41:01,745 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:41:01,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 09:41:01,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:41:01,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:41:02,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:41:02,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:41:02,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:41:02,889 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:41:02,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:41:02,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:02,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:41:03,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-12-13 09:41:03,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:03,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:41:03,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:41:03,630 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:41:03,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 09:41:03,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:03,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:41:04,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 09:41:04,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:04,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:41:04,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:41:04,441 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:41:04,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-13 09:41:04,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:04,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:41:04,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 09:41:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 177 proven. 85 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 09:41:04,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:41:41,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:41:41,203 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 1024 treesize of output 654 [2022-12-13 09:41:41,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:41:41,227 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 1453 treesize of output 1447 [2022-12-13 09:41:41,248 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 1222 treesize of output 1214 [2022-12-13 09:41:41,273 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 1087 treesize of output 991 [2022-12-13 09:41:41,285 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 1307 treesize of output 1291 [2022-12-13 09:41:41,301 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 1360 treesize of output 1168 [2022-12-13 09:41:41,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 09:41:41,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:41:41,758 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 354 treesize of output 350 [2022-12-13 09:41:42,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:41:42,662 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-12-13 09:41:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 205 proven. 65 refuted. 20 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:41:42,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846982572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:41:42,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:41:42,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37, 48] total 112 [2022-12-13 09:41:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193061481] [2022-12-13 09:41:42,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:41:42,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-12-13 09:41:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:41:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-12-13 09:41:42,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1351, Invalid=10881, Unknown=200, NotChecked=0, Total=12432 [2022-12-13 09:41:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:41:42,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:41:42,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 5.473214285714286) internal successors, (613), 112 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-12-13 09:41:42,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:43:22,304 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-12-13 09:43:24,314 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-12-13 09:43:53,218 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-12-13 09:43:55,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:43:57,243 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-12-13 09:43:59,263 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-12-13 09:44:27,674 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-12-13 09:44:29,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:44:31,955 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-12-13 09:44:33,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:44:50,220 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-12-13 09:44:53,040 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-12-13 09:45:27,823 WARN L233 SmtUtils]: Spent 19.51s on a formula simplification. DAG size of input: 92 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:45:29,910 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-12-13 09:46:03,100 WARN L233 SmtUtils]: Spent 18.56s on a formula simplification. DAG size of input: 99 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:46:05,115 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]