./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a --- 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-6b4ec56 [2022-11-20 10:35:39,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:35:39,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:35:39,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:35:39,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:35:39,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:35:39,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:35:39,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:35:39,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:35:39,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:35:39,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:35:39,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:35:39,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:35:39,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:35:39,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:35:39,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:35:39,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:35:39,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:35:39,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:35:39,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:35:39,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:35:39,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:35:39,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:35:39,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:35:39,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:35:39,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:35:39,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:35:39,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:35:39,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:35:39,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:35:39,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:35:39,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:35:39,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:35:39,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:35:39,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:35:39,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:35:39,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:35:39,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:35:39,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:35:39,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:35:39,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:35:39,102 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 10:35:39,138 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:35:39,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:35:39,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:35:39,144 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:35:39,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:35:39,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:35:39,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:35:39,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:35:39,148 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:35:39,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:35:39,149 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:35:39,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:35:39,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:35:39,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:35:39,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:35:39,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:35:39,151 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:35:39,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:35:39,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:35:39,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:35:39,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:35:39,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:35:39,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:35:39,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:39,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:35:39,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:35:39,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:35:39,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:35:39,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:35:39,154 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:35:39,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:35:39,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:35:39,154 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_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/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_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a [2022-11-20 10:35:39,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:35:39,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:35:39,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:35:39,436 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:35:39,437 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:35:39,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2022-11-20 10:35:42,487 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:35:42,734 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:35:42,735 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2022-11-20 10:35:42,752 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/data/76916167c/63dc1b8aab2342069de23afcbbed85c2/FLAG0db7335d7 [2022-11-20 10:35:42,772 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/data/76916167c/63dc1b8aab2342069de23afcbbed85c2 [2022-11-20 10:35:42,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:35:42,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:35:42,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:42,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:35:42,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:35:42,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:42" (1/1) ... [2022-11-20 10:35:42,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302dbbe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:42, skipping insertion in model container [2022-11-20 10:35:42,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:42" (1/1) ... [2022-11-20 10:35:42,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:35:42,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:35:43,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:43,114 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:35:43,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:43,216 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:35:43,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43 WrapperNode [2022-11-20 10:35:43,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:43,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:43,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:35:43,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:35:43,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,263 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-11-20 10:35:43,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:43,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:35:43,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:35:43,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:35:43,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,290 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:35:43,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:35:43,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:35:43,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:35:43,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (1/1) ... [2022-11-20 10:35:43,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:43,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:35:43,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:35:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:35:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:35:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:35:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:35:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:35:43,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:35:43,523 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:35:43,525 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:35:43,745 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:35:43,750 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:35:43,766 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:35:43,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:43 BoogieIcfgContainer [2022-11-20 10:35:43,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:35:43,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:35:43,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:35:43,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:35:43,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:35:42" (1/3) ... [2022-11-20 10:35:43,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ba879c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:43, skipping insertion in model container [2022-11-20 10:35:43,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:43" (2/3) ... [2022-11-20 10:35:43,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ba879c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:43, skipping insertion in model container [2022-11-20 10:35:43,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:43" (3/3) ... [2022-11-20 10:35:43,778 INFO L112 eAbstractionObserver]: Analyzing ICFG b.14-alloca.i [2022-11-20 10:35:43,798 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:35:43,798 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-20 10:35:43,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:35:43,893 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=PETRI_NET, 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;@500b6310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:35:43,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 10:35:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:35:43,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:43,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:43,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:35:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash 177751404, now seen corresponding path program 1 times [2022-11-20 10:35:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:43,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134540492] [2022-11-20 10:35:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:44,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134540492] [2022-11-20 10:35:44,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134540492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:44,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:44,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:35:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167881681] [2022-11-20 10:35:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:44,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:35:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:35:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:35:44,977 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:45,263 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2022-11-20 10:35:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:35:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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) Word has length 8 [2022-11-20 10:35:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:45,273 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:35:45,274 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 10:35:45,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:35:45,280 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:45,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 73 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 10:35:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2022-11-20 10:35:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-20 10:35:45,315 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2022-11-20 10:35:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:45,315 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-20 10:35:45,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-20 10:35:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:35:45,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:45,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:45,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:35:45,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:35:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326290, now seen corresponding path program 1 times [2022-11-20 10:35:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:45,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52753213] [2022-11-20 10:35:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:45,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52753213] [2022-11-20 10:35:45,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52753213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:45,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:45,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:35:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044343428] [2022-11-20 10:35:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:45,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:35:45,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:35:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:45,456 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:45,510 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-11-20 10:35:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:35:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2022-11-20 10:35:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:45,512 INFO L225 Difference]: With dead ends: 37 [2022-11-20 10:35:45,512 INFO L226 Difference]: Without dead ends: 36 [2022-11-20 10:35:45,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:35:45,514 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:45,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-20 10:35:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-20 10:35:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-20 10:35:45,521 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2022-11-20 10:35:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:45,521 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-20 10:35:45,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-20 10:35:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:35:45,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:45,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:45,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:35:45,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:35:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash -979590610, now seen corresponding path program 1 times [2022-11-20 10:35:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:45,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304334354] [2022-11-20 10:35:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:45,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304334354] [2022-11-20 10:35:45,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304334354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:45,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:45,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:35:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374118640] [2022-11-20 10:35:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:45,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:35:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:35:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:35:45,773 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:45,997 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-20 10:35:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:35:45,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) Word has length 10 [2022-11-20 10:35:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:46,001 INFO L225 Difference]: With dead ends: 46 [2022-11-20 10:35:46,001 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 10:35:46,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:35:46,009 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:46,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 47 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 10:35:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-11-20 10:35:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-20 10:35:46,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 10 [2022-11-20 10:35:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-20 10:35:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-20 10:35:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:35:46,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:46,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:46,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:35:46,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:35:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash -302537772, now seen corresponding path program 1 times [2022-11-20 10:35:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:46,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345593527] [2022-11-20 10:35:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:46,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345593527] [2022-11-20 10:35:46,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345593527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:46,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:46,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:35:46,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791877822] [2022-11-20 10:35:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:46,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:35:46,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:35:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:35:46,345 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:46,486 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-20 10:35:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:35:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) Word has length 11 [2022-11-20 10:35:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:46,488 INFO L225 Difference]: With dead ends: 39 [2022-11-20 10:35:46,488 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 10:35:46,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:35:46,498 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:46,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 56 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 10:35:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-11-20 10:35:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.48) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-20 10:35:46,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 11 [2022-11-20 10:35:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:46,509 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-20 10:35:46,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-20 10:35:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:35:46,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:46,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:46,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:35:46,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:35:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -788736272, now seen corresponding path program 1 times [2022-11-20 10:35:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:46,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785145439] [2022-11-20 10:35:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:46,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785145439] [2022-11-20 10:35:46,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785145439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:46,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:46,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:35:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100501881] [2022-11-20 10:35:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:46,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:35:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:35:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:35:46,907 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:46,968 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-11-20 10:35:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:35:46,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 12 [2022-11-20 10:35:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:46,969 INFO L225 Difference]: With dead ends: 44 [2022-11-20 10:35:46,969 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 10:35:46,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:35:46,970 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:46,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:35:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 10:35:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-20 10:35:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-20 10:35:46,977 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 12 [2022-11-20 10:35:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:46,977 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-20 10:35:46,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-20 10:35:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:35:46,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:46,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:46,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:35:46,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:35:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash -940015839, now seen corresponding path program 1 times [2022-11-20 10:35:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217207447] [2022-11-20 10:35:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:47,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:47,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217207447] [2022-11-20 10:35:47,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217207447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:35:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211011779] [2022-11-20 10:35:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:47,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:35:47,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:47,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:35:47,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:35:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:47,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 10:35:47,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:48,377 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-20 10:35:48,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 462 treesize of output 894 [2022-11-20 10:35:48,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:35:48,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:35:48,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:35:48,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:35:50,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:50,629 INFO L321 Elim1Store]: treesize reduction 117, result has 17.6 percent of original size [2022-11-20 10:35:50,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 1053 treesize of output 1123 [2022-11-20 10:35:51,718 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 9 treesize of output 7 [2022-11-20 10:35:51,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 83 [2022-11-20 10:35:52,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:52,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:52,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-20 10:35:52,544 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:35:53,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:53,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:53,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:53,919 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 151 treesize of output 100 [2022-11-20 10:35:53,925 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 9 treesize of output 7 [2022-11-20 10:35:53,943 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 9 treesize of output 7 [2022-11-20 10:35:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:54,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:54,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 101 [2022-11-20 10:35:54,088 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 9 treesize of output 7 [2022-11-20 10:35:54,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:54,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:54,189 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:35:54,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1842 treesize of output 1671 [2022-11-20 10:35:54,647 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 9 treesize of output 7 [2022-11-20 10:35:54,660 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 9 treesize of output 7 [2022-11-20 10:35:54,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:54,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:54,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:54,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:54,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:54,696 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 141 treesize of output 94 [2022-11-20 10:36:06,391 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-20 10:36:06,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1902 treesize of output 1729 [2022-11-20 10:36:06,817 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 15 treesize of output 11 [2022-11-20 10:36:06,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:06,904 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 28 treesize of output 22 [2022-11-20 10:36:07,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,094 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 28 treesize of output 22 [2022-11-20 10:36:07,215 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 15 treesize of output 11 [2022-11-20 10:36:07,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,302 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 77 treesize of output 75 [2022-11-20 10:36:07,333 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 15 treesize of output 11 [2022-11-20 10:36:07,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2022-11-20 10:36:07,398 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 9 treesize of output 7 [2022-11-20 10:36:07,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 178 [2022-11-20 10:36:07,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 7 [2022-11-20 10:36:07,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:07,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 154 [2022-11-20 10:36:08,149 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-20 10:36:08,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 76 [2022-11-20 10:36:08,414 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-20 10:36:08,415 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 67 treesize of output 62 [2022-11-20 10:36:08,425 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 49 treesize of output 45 [2022-11-20 10:36:08,671 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 24 treesize of output 12 [2022-11-20 10:36:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:08,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:36:08,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_194 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483649)) is different from false [2022-11-20 10:36:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211011779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:36:09,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:36:09,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 30 [2022-11-20 10:36:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190153308] [2022-11-20 10:36:09,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:36:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 10:36:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 10:36:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=723, Unknown=13, NotChecked=56, Total=930 [2022-11-20 10:36:09,724 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:36:14,032 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-20 10:36:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:36:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 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) Word has length 16 [2022-11-20 10:36:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:36:14,033 INFO L225 Difference]: With dead ends: 57 [2022-11-20 10:36:14,033 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 10:36:14,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=268, Invalid=1265, Unknown=31, NotChecked=76, Total=1640 [2022-11-20 10:36:14,034 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:36:14,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 40 Unchecked, 0.0s Time] [2022-11-20 10:36:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 10:36:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-20 10:36:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-11-20 10:36:14,051 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 16 [2022-11-20 10:36:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:36:14,051 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-11-20 10:36:14,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-11-20 10:36:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:36:14,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:36:14,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:36:14,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:36:14,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:36:14,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:36:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1526821853, now seen corresponding path program 1 times [2022-11-20 10:36:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:14,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889775593] [2022-11-20 10:36:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:36:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889775593] [2022-11-20 10:36:14,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889775593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:36:14,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:36:14,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:36:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615154481] [2022-11-20 10:36:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:36:14,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:36:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:36:14,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:36:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:36:14,302 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:36:14,316 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-11-20 10:36:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:36:14,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 16 [2022-11-20 10:36:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:36:14,322 INFO L225 Difference]: With dead ends: 92 [2022-11-20 10:36:14,322 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:36:14,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:36:14,324 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:36:14,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:36:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:36:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 10:36:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-20 10:36:14,339 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 16 [2022-11-20 10:36:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:36:14,339 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-20 10:36:14,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:36:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-20 10:36:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:36:14,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:36:14,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:36:14,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:36:14,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:36:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:36:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 924280125, now seen corresponding path program 1 times [2022-11-20 10:36:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:36:14,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581792865] [2022-11-20 10:36:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:36:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:36:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:36:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581792865] [2022-11-20 10:36:14,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581792865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:36:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723487252] [2022-11-20 10:36:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:36:14,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:36:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:36:14,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:36:14,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:36:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:36:14,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 10:36:14,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:36:15,466 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-20 10:36:15,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-20 10:36:15,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:36:15,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:36:15,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:36:15,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:36:20,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2724 treesize of output 2467 [2022-11-20 10:36:22,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:22,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 5 [2022-11-20 10:36:22,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:22,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 5 [2022-11-20 10:36:22,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:22,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 5 [2022-11-20 10:36:22,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:22,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 5 [2022-11-20 10:36:22,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:22,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 5 [2022-11-20 10:36:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:23,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:23,191 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:36:23,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 755 treesize of output 648 [2022-11-20 10:36:24,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:24,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:24,501 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:36:24,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 663 treesize of output 602 [2022-11-20 10:36:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,298 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 74 treesize of output 33 [2022-11-20 10:36:25,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,446 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 151 treesize of output 100 [2022-11-20 10:36:25,450 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 9 treesize of output 7 [2022-11-20 10:36:25,459 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 9 treesize of output 7 [2022-11-20 10:36:25,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,482 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 0 case distinctions, treesize of input 112 treesize of output 55 [2022-11-20 10:36:25,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 10:36:25,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:25,519 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 179 treesize of output 126 [2022-11-20 10:36:25,528 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 37 treesize of output 29 [2022-11-20 10:36:25,534 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 9 treesize of output 7 [2022-11-20 10:36:25,548 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 30 treesize of output 24 [2022-11-20 10:36:25,563 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 9 treesize of output 7 [2022-11-20 10:36:25,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 56 [2022-11-20 10:36:25,793 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 37 treesize of output 29 [2022-11-20 10:36:25,804 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 9 treesize of output 7 [2022-11-20 10:36:25,813 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 9 treesize of output 7 [2022-11-20 10:36:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:36:25,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 59 [2022-11-20 10:36:25,840 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 9 treesize of output 7 [2022-11-20 10:36:25,844 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 37 treesize of output 29 [2022-11-20 10:36:25,850 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 30 treesize of output 24 [2022-11-20 10:36:26,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:26,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:26,866 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 0 case distinctions, treesize of input 91 treesize of output 31 [2022-11-20 10:36:26,870 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 9 treesize of output 7 [2022-11-20 10:36:26,875 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 9 treesize of output 7 [2022-11-20 10:36:27,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:27,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:36:27,957 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:36:29,032 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:36:29,607 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 9 treesize of output 7 [2022-11-20 10:36:55,535 WARN L233 SmtUtils]: Spent 24.90s on a formula simplification. DAG size of input: 1107 DAG size of output: 1039 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:14,908 WARN L233 SmtUtils]: Spent 16.47s on a formula simplification that was a NOOP. DAG size: 1045 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:28,708 WARN L233 SmtUtils]: Spent 10.82s on a formula simplification that was a NOOP. DAG size: 1039 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:53,350 WARN L233 SmtUtils]: Spent 18.38s on a formula simplification that was a NOOP. DAG size: 1041 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:55,411 INFO L321 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2022-11-20 10:37:55,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2463 treesize of output 2336 [2022-11-20 10:37:55,728 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 22 treesize of output 16 [2022-11-20 10:37:55,736 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 9 treesize of output 7 [2022-11-20 10:37:55,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:55,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2022-11-20 10:37:55,826 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:37:55,839 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 22 treesize of output 16 [2022-11-20 10:37:55,845 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 15 treesize of output 11 [2022-11-20 10:37:55,980 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 22 treesize of output 16 [2022-11-20 10:37:55,986 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 15 treesize of output 11 [2022-11-20 10:37:56,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2022-11-20 10:37:56,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 15 [2022-11-20 10:37:56,092 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 0 case distinctions, treesize of input 35 treesize of output 31 [2022-11-20 10:37:56,484 INFO L321 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2022-11-20 10:37:56,484 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 4 case distinctions, treesize of input 60 treesize of output 62 [2022-11-20 10:37:56,805 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:37:56,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2022-11-20 10:37:56,819 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 5 treesize of output 3 [2022-11-20 10:37:57,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 15 treesize of output 7 [2022-11-20 10:37:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:57,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:59,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723487252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:37:59,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:37:59,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-11-20 10:37:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83574682] [2022-11-20 10:37:59,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 10:37:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 10:37:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=640, Unknown=26, NotChecked=0, Total=812 [2022-11-20 10:37:59,499 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:19,202 WARN L233 SmtUtils]: Spent 18.79s on a formula simplification. DAG size of input: 1045 DAG size of output: 920 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:40,393 WARN L233 SmtUtils]: Spent 19.55s on a formula simplification. DAG size of input: 1052 DAG size of output: 927 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:39:10,999 WARN L233 SmtUtils]: Spent 30.10s on a formula simplification. DAG size of input: 1046 DAG size of output: 1045 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:39:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:16,046 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-20 10:39:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:39:16,047 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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) Word has length 17 [2022-11-20 10:39:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:16,048 INFO L225 Difference]: With dead ends: 92 [2022-11-20 10:39:16,048 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 10:39:16,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 153.1s TimeCoverageRelationStatistics Valid=315, Invalid=1297, Unknown=28, NotChecked=0, Total=1640 [2022-11-20 10:39:16,049 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:16,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 122 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2022-11-20 10:39:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 10:39:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2022-11-20 10:39:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-11-20 10:39:16,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2022-11-20 10:39:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:16,063 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-11-20 10:39:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-11-20 10:39:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:39:16,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:16,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:16,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 10:39:16,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:16,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1412087133, now seen corresponding path program 1 times [2022-11-20 10:39:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:16,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689156481] [2022-11-20 10:39:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:16,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689156481] [2022-11-20 10:39:16,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689156481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029902902] [2022-11-20 10:39:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:16,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:16,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:39:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:16,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 10:39:16,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:17,025 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:39:17,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:39:17,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:17,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:17,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:17,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:17,778 INFO L321 Elim1Store]: treesize reduction 41, result has 29.3 percent of original size [2022-11-20 10:39:17,778 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 430 treesize of output 370 [2022-11-20 10:39:17,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:17,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:17,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:18,019 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 53 treesize of output 45 [2022-11-20 10:39:18,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:18,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 324 treesize of output 330 [2022-11-20 10:39:18,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:18,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:18,770 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 5 treesize of output 3 [2022-11-20 10:39:18,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-20 10:39:18,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:39:18,986 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 14 treesize of output 16 [2022-11-20 10:39:19,085 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 28 treesize of output 20 [2022-11-20 10:39:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:19,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:19,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:19,346 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 37 treesize of output 30 [2022-11-20 10:39:19,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:19,367 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 280 treesize of output 270 [2022-11-20 10:39:19,401 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 294 treesize of output 278 [2022-11-20 10:39:19,428 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 158 treesize of output 150 [2022-11-20 10:39:19,587 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 216 treesize of output 206 [2022-11-20 10:39:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:20,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029902902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:20,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:20,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 24 [2022-11-20 10:39:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026505678] [2022-11-20 10:39:20,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:20,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:39:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:39:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=486, Unknown=7, NotChecked=0, Total=600 [2022-11-20 10:39:20,287 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:21,038 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-11-20 10:39:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:39:21,038 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 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) Word has length 18 [2022-11-20 10:39:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:21,039 INFO L225 Difference]: With dead ends: 42 [2022-11-20 10:39:21,039 INFO L226 Difference]: Without dead ends: 41 [2022-11-20 10:39:21,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=268, Invalid=847, Unknown=7, NotChecked=0, Total=1122 [2022-11-20 10:39:21,040 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:21,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 89 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 142 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2022-11-20 10:39:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-20 10:39:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-20 10:39:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-20 10:39:21,053 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2022-11-20 10:39:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:21,053 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-20 10:39:21,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-20 10:39:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 10:39:21,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:21,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:21,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:21,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 10:39:21,259 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:21,259 INFO L85 PathProgramCache]: Analyzing trace with hash -825028097, now seen corresponding path program 1 times [2022-11-20 10:39:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:21,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511870429] [2022-11-20 10:39:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:21,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511870429] [2022-11-20 10:39:21,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511870429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:21,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152853179] [2022-11-20 10:39:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:21,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:21,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:39:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:21,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:39:21,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:21,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:21,678 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 37 treesize of output 33 [2022-11-20 10:39:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:21,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:21,836 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 10:39:21,836 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 48 treesize of output 1 [2022-11-20 10:39:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152853179] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:21,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:39:21,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 12 [2022-11-20 10:39:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321014800] [2022-11-20 10:39:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:39:21,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:39:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:39:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:39:21,840 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:21,860 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-11-20 10:39:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:39:21,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2022-11-20 10:39:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:21,861 INFO L225 Difference]: With dead ends: 39 [2022-11-20 10:39:21,861 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 10:39:21,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:39:21,862 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:21,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-11-20 10:39:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 10:39:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-20 10:39:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-20 10:39:21,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2022-11-20 10:39:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:21,875 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-20 10:39:21,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-20 10:39:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:39:21,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:21,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:21,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:22,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash 193932837, now seen corresponding path program 1 times [2022-11-20 10:39:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:22,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317631313] [2022-11-20 10:39:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317631313] [2022-11-20 10:39:22,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317631313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405550365] [2022-11-20 10:39:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:22,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:22,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:39:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:22,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 10:39:22,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:22,728 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:39:22,729 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 90 treesize of output 84 [2022-11-20 10:39:22,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:22,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-20 10:39:22,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:23,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2022-11-20 10:39:23,011 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 9 treesize of output 7 [2022-11-20 10:39:23,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-20 10:39:23,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:39:23,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-20 10:39:23,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:23,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 10:39:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:23,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:27,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405550365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:27,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:27,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2022-11-20 10:39:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725134239] [2022-11-20 10:39:27,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:27,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 10:39:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 10:39:27,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=599, Unknown=32, NotChecked=0, Total=812 [2022-11-20 10:39:27,366 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:28,055 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-20 10:39:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:39:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 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) Word has length 20 [2022-11-20 10:39:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:28,058 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:39:28,059 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 10:39:28,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=347, Invalid=1084, Unknown=51, NotChecked=0, Total=1482 [2022-11-20 10:39:28,060 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:28,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2022-11-20 10:39:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 10:39:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-20 10:39:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-11-20 10:39:28,077 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 20 [2022-11-20 10:39:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:28,077 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-11-20 10:39:28,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-11-20 10:39:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:39:28,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:28,079 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:28,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:39:28,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -737334045, now seen corresponding path program 1 times [2022-11-20 10:39:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:28,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801922383] [2022-11-20 10:39:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:28,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801922383] [2022-11-20 10:39:28,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801922383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867858506] [2022-11-20 10:39:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:28,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:28,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:28,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:39:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:28,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:39:28,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:28,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:39:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:28,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:28,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867858506] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:28,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:28,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-20 10:39:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165499660] [2022-11-20 10:39:28,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:28,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:39:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:39:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:39:28,558 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:28,640 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-11-20 10:39:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:39:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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) Word has length 21 [2022-11-20 10:39:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:28,641 INFO L225 Difference]: With dead ends: 64 [2022-11-20 10:39:28,641 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 10:39:28,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:39:28,642 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:28,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:39:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 10:39:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-20 10:39:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-20 10:39:28,654 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2022-11-20 10:39:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:28,654 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-20 10:39:28,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-20 10:39:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:39:28,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:28,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:28,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:28,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:39:28,861 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:28,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1716950721, now seen corresponding path program 1 times [2022-11-20 10:39:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:28,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198831554] [2022-11-20 10:39:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:29,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:29,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198831554] [2022-11-20 10:39:29,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198831554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:29,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219090159] [2022-11-20 10:39:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:29,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:29,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:29,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:29,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:39:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:29,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 10:39:29,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:29,461 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 8 [2022-11-20 10:39:29,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:29,656 INFO L321 Elim1Store]: treesize reduction 78, result has 48.0 percent of original size [2022-11-20 10:39:29,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 237 [2022-11-20 10:39:29,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:29,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:29,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:29,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:29,820 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-20 10:39:29,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 92 [2022-11-20 10:39:29,840 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 5 treesize of output 3 [2022-11-20 10:39:29,911 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:39:29,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:29,936 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 53 treesize of output 16 [2022-11-20 10:39:29,943 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 5 treesize of output 3 [2022-11-20 10:39:29,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 17 [2022-11-20 10:39:30,003 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 5 treesize of output 3 [2022-11-20 10:39:30,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 183 [2022-11-20 10:39:30,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:30,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 22 treesize of output 18 [2022-11-20 10:39:30,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:30,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 22 treesize of output 18 [2022-11-20 10:39:30,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:30,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-20 10:39:30,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:30,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-11-20 10:39:30,743 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-20 10:39:30,743 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 25 treesize of output 40 [2022-11-20 10:39:30,760 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 9 treesize of output 7 [2022-11-20 10:39:30,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:39:30,947 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:39:30,947 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 45 treesize of output 48 [2022-11-20 10:39:31,220 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:39:31,221 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 65 treesize of output 64 [2022-11-20 10:39:31,580 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:39:31,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-20 10:39:31,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:31,658 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 35 treesize of output 31 [2022-11-20 10:39:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:31,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:37,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219090159] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:37,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:37,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-11-20 10:39:37,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627025077] [2022-11-20 10:39:37,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:37,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 10:39:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:37,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 10:39:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=667, Unknown=16, NotChecked=0, Total=812 [2022-11-20 10:39:37,182 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:38,234 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-11-20 10:39:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:39:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 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) Word has length 21 [2022-11-20 10:39:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:38,235 INFO L225 Difference]: With dead ends: 44 [2022-11-20 10:39:38,235 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 10:39:38,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=300, Invalid=1314, Unknown=26, NotChecked=0, Total=1640 [2022-11-20 10:39:38,237 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:38,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 100 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2022-11-20 10:39:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 10:39:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-11-20 10:39:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-11-20 10:39:38,251 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 21 [2022-11-20 10:39:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:38,251 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-11-20 10:39:38,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-11-20 10:39:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:39:38,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:38,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:38,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:38,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:38,459 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 913454038, now seen corresponding path program 2 times [2022-11-20 10:39:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:38,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869315297] [2022-11-20 10:39:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:39,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869315297] [2022-11-20 10:39:39,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869315297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200489913] [2022-11-20 10:39:39,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:39:39,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:39,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:39,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:39,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:39:39,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:39:39,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:39:39,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 10:39:39,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:39,395 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 8 [2022-11-20 10:39:39,563 INFO L321 Elim1Store]: treesize reduction 78, result has 41.4 percent of original size [2022-11-20 10:39:39,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 220 [2022-11-20 10:39:39,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:39,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:39,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:39,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:39,729 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-20 10:39:39,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 115 [2022-11-20 10:39:39,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:39,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:39,825 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:39:39,885 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 126 treesize of output 70 [2022-11-20 10:39:39,895 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 9 treesize of output 7 [2022-11-20 10:39:40,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:40,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:40,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 233 [2022-11-20 10:39:40,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:40,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:40,833 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 13 treesize of output 9 [2022-11-20 10:39:40,848 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:39:40,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:40,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:40,876 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 18 treesize of output 22 [2022-11-20 10:39:40,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-20 10:39:41,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:39:41,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:39:41,253 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 14 treesize of output 16 [2022-11-20 10:39:41,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:39:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:39:41,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:41,436 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483649)) is different from false [2022-11-20 10:39:41,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:41,450 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 21 treesize of output 22 [2022-11-20 10:39:41,454 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 124 treesize of output 112 [2022-11-20 10:39:41,460 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 53 treesize of output 49 [2022-11-20 10:39:41,464 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 102 treesize of output 94 [2022-11-20 10:39:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-20 10:39:41,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200489913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:41,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:41,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-11-20 10:39:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531761669] [2022-11-20 10:39:41,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:39:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:39:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=545, Unknown=3, NotChecked=48, Total=702 [2022-11-20 10:39:41,845 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 27 states, 26 states have (on average 2.5) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:46,995 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-11-20 10:39:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:39:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 27 states have internal predecessors, (65), 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) Word has length 24 [2022-11-20 10:39:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:46,997 INFO L225 Difference]: With dead ends: 41 [2022-11-20 10:39:46,997 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 10:39:46,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=298, Invalid=962, Unknown=4, NotChecked=68, Total=1332 [2022-11-20 10:39:46,998 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:46,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 69 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-11-20 10:39:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 10:39:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-20 10:39:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-11-20 10:39:47,011 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 24 [2022-11-20 10:39:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:47,011 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-11-20 10:39:47,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-11-20 10:39:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:39:47,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:47,012 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:47,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:47,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:39:47,217 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1747695832, now seen corresponding path program 2 times [2022-11-20 10:39:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:47,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896355199] [2022-11-20 10:39:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896355199] [2022-11-20 10:39:47,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896355199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481451556] [2022-11-20 10:39:47,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:39:47,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:47,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:47,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:39:47,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:39:47,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:39:47,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 10:39:47,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:48,051 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:39:48,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:39:48,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:48,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:48,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:48,511 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:39:48,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 68 [2022-11-20 10:39:48,517 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 9 treesize of output 7 [2022-11-20 10:39:48,522 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 9 treesize of output 7 [2022-11-20 10:39:48,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:48,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:48,603 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:39:48,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 194 [2022-11-20 10:39:48,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:39:48,689 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 22 treesize of output 16 [2022-11-20 10:39:48,710 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 15 treesize of output 11 [2022-11-20 10:39:48,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:39:48,733 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 15 treesize of output 11 [2022-11-20 10:39:49,245 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:39:49,245 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 35 treesize of output 30 [2022-11-20 10:39:49,342 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 10:39:49,342 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 21 treesize of output 34 [2022-11-20 10:39:49,349 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 5 treesize of output 3 [2022-11-20 10:39:49,420 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 29 treesize of output 29 [2022-11-20 10:39:49,566 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 32 treesize of output 20 [2022-11-20 10:39:49,650 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:39:49,651 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 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-20 10:39:49,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 10:39:49,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:49,796 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 33 treesize of output 25 [2022-11-20 10:39:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:49,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:51,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481451556] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:51,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:51,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 35 [2022-11-20 10:39:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78040052] [2022-11-20 10:39:51,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 10:39:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 10:39:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=925, Unknown=91, NotChecked=0, Total=1260 [2022-11-20 10:39:51,390 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:52,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (or (< 0 (+ .cse0 2147483648)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_818)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_820))) (or (< (+ v_ArrVal_818 1) .cse0) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-20 10:39:53,001 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (or (< 0 (+ .cse0 2147483648)) (not (< 0 |c_ULTIMATE.start_test_fun_#t~mem9#1|))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_818)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_820))) (or (< (+ v_ArrVal_818 1) .cse0) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-20 10:39:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:53,216 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-11-20 10:39:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:39:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 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) Word has length 25 [2022-11-20 10:39:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:53,218 INFO L225 Difference]: With dead ends: 55 [2022-11-20 10:39:53,218 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 10:39:53,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=625, Invalid=1968, Unknown=171, NotChecked=206, Total=2970 [2022-11-20 10:39:53,220 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:53,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 218 Unchecked, 0.1s Time] [2022-11-20 10:39:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 10:39:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-11-20 10:39:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-11-20 10:39:53,232 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 25 [2022-11-20 10:39:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:53,232 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-11-20 10:39:53,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-11-20 10:39:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:39:53,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:53,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:53,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 10:39:53,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:53,436 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:39:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -868954737, now seen corresponding path program 2 times [2022-11-20 10:39:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:53,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408573667] [2022-11-20 10:39:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:54,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408573667] [2022-11-20 10:39:54,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408573667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:54,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165201876] [2022-11-20 10:39:54,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:39:54,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:54,300 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:54,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:39:54,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:39:54,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:39:54,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 10:39:54,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:54,674 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:39:54,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:39:54,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:54,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:54,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:39:55,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:55,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:55,041 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:39:55,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 171 [2022-11-20 10:39:55,069 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 9 treesize of output 7 [2022-11-20 10:39:55,103 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 9 treesize of output 7 [2022-11-20 10:39:55,125 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 9 treesize of output 7 [2022-11-20 10:39:55,183 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-20 10:39:55,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 93 [2022-11-20 10:39:55,209 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 9 treesize of output 7 [2022-11-20 10:39:55,351 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-20 10:39:55,352 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 6 case distinctions, treesize of input 96 treesize of output 25 [2022-11-20 10:39:55,358 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 15 treesize of output 11 [2022-11-20 10:39:55,378 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 14 treesize of output 12 [2022-11-20 10:39:55,854 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-20 10:39:55,854 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 32 treesize of output 45 [2022-11-20 10:39:55,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:39:56,002 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:39:56,003 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 25 treesize of output 29 [2022-11-20 10:39:56,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:39:56,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:39:56,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:39:56,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:39:56,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:39:56,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:39:56,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:39:56,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:39:56,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:56,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-20 10:39:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:56,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:56,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930))))) is different from false [2022-11-20 10:39:57,799 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_922 Int) (v_ArrVal_930 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_922)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_924) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_925))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930) (not (<= v_ArrVal_922 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_927))))))) is different from false [2022-11-20 10:39:57,854 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_922 Int) (v_ArrVal_930 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_921))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_922)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_924) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_925))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_922) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_927))))))))) is different from false [2022-11-20 10:40:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 16 refuted. 14 times theorem prover too weak. 0 trivial. 15 not checked. [2022-11-20 10:40:01,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165201876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:40:01,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:40:01,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2022-11-20 10:40:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565763861] [2022-11-20 10:40:01,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:01,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 10:40:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 10:40:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=971, Unknown=72, NotChecked=216, Total=1560 [2022-11-20 10:40:01,051 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 40 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 40 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:31,197 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 92 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:40:31,207 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| 3) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930) (not (<= v_ArrVal_927 .cse2)))))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_922 Int) (v_ArrVal_930 Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_922)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_924) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_925))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930) (not (<= v_ArrVal_922 .cse2)) (< (select (select (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_927))))))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_930 Int)) (or (not (<= v_ArrVal_930 .cse2)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-20 10:40:31,215 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930) (not (<= v_ArrVal_927 .cse2)))))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_922 Int) (v_ArrVal_930 Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_922)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_924) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_925))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930) (not (<= v_ArrVal_922 .cse2)) (< (select (select (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_927))))))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_930 Int)) (or (not (<= v_ArrVal_930 .cse2)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-20 10:40:33,513 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_933 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_925))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_927)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_927) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930))))))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930)))))) is different from false [2022-11-20 10:40:36,765 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_933 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_ArrVal_930 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_929))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_930)))))) is different from false [2022-11-20 10:40:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:37,135 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-11-20 10:40:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:40:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 40 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) Word has length 36 [2022-11-20 10:40:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:37,137 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:40:37,137 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 10:40:37,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=564, Invalid=1664, Unknown=152, NotChecked=700, Total=3080 [2022-11-20 10:40:37,140 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:37,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 106 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 77 Unchecked, 0.0s Time] [2022-11-20 10:40:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 10:40:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-11-20 10:40:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-11-20 10:40:37,155 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 36 [2022-11-20 10:40:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:37,156 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-11-20 10:40:37,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 40 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-11-20 10:40:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:40:37,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:37,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:37,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:37,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:40:37,364 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:40:37,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1167793001, now seen corresponding path program 2 times [2022-11-20 10:40:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:37,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668322280] [2022-11-20 10:40:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:38,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:38,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668322280] [2022-11-20 10:40:38,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668322280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:38,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379304912] [2022-11-20 10:40:38,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:40:38,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:38,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:38,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:40:38,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:40:38,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:40:38,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 10:40:38,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:38,867 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:40:38,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:40:38,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:40:38,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:40:38,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:40:39,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:39,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:39,258 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:40:39,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 126 [2022-11-20 10:40:39,265 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 9 treesize of output 7 [2022-11-20 10:40:39,272 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 9 treesize of output 7 [2022-11-20 10:40:39,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:39,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:39,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:39,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 85 treesize of output 78 [2022-11-20 10:40:39,342 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 9 treesize of output 7 [2022-11-20 10:40:40,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:40:40,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1422 treesize of output 1396 [2022-11-20 10:40:40,828 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 13 treesize of output 9 [2022-11-20 10:40:40,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:40:40,927 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 20 treesize of output 14 [2022-11-20 10:40:40,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:40:40,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:40:41,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:40:41,073 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 5 treesize of output 3 [2022-11-20 10:40:41,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-20 10:40:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-20 10:40:41,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:40:41,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:40:41,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:41,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 10:40:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:40:41,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:40:44,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:40:44,022 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 23 treesize of output 24 [2022-11-20 10:40:44,026 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 69 treesize of output 61 [2022-11-20 10:40:44,030 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 56 treesize of output 52 [2022-11-20 10:40:44,035 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 26 treesize of output 24 [2022-11-20 10:40:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 12 refuted. 12 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:40:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379304912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:40:44,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:40:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 27 [2022-11-20 10:40:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731202122] [2022-11-20 10:40:44,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:40:44,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 10:40:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:40:44,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 10:40:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=613, Unknown=9, NotChecked=0, Total=756 [2022-11-20 10:40:44,506 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:40:45,251 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-20 10:40:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:40:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 28 states have internal predecessors, (79), 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) Word has length 37 [2022-11-20 10:40:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:40:45,253 INFO L225 Difference]: With dead ends: 71 [2022-11-20 10:40:45,253 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:40:45,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=318, Invalid=1079, Unknown=9, NotChecked=0, Total=1406 [2022-11-20 10:40:45,254 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:40:45,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 80 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 159 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-11-20 10:40:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:40:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:40:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-11-20 10:40:45,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 37 [2022-11-20 10:40:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:40:45,269 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-11-20 10:40:45,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:40:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-11-20 10:40:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 10:40:45,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:40:45,270 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-20 10:40:45,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:40:45,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:40:45,476 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:40:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:40:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 914115305, now seen corresponding path program 3 times [2022-11-20 10:40:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:40:45,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15282883] [2022-11-20 10:40:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:40:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:40:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:40:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:40:46,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15282883] [2022-11-20 10:40:46,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15282883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:40:46,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232937452] [2022-11-20 10:40:46,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:40:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:40:46,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:40:46,640 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:40:46,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7586807-734a-462f-9091-f1594b09fe4a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:40:46,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 10:40:46,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:40:46,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-20 10:40:46,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:40:47,077 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:40:47,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:40:47,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:40:47,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:40:47,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:40:47,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:40:47,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:47,401 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 119 treesize of output 78 [2022-11-20 10:40:47,413 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 22 treesize of output 16 [2022-11-20 10:40:47,417 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 15 treesize of output 11 [2022-11-20 10:40:47,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:47,570 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:40:47,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 130 [2022-11-20 10:40:47,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:40:47,583 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 52 treesize of output 15 [2022-11-20 10:40:47,590 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 9 treesize of output 7 [2022-11-20 10:40:47,604 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 22 treesize of output 16 [2022-11-20 10:40:47,622 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 9 treesize of output 7 [2022-11-20 10:40:47,629 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 15 treesize of output 11 [2022-11-20 10:40:48,612 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-20 10:40:48,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 434 treesize of output 423 [2022-11-20 10:40:49,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:40:49,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:40:49,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 23 [2022-11-20 10:40:49,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 16 [2022-11-20 10:40:49,127 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 15 treesize of output 11 [2022-11-20 10:40:49,366 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-20 10:40:49,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 68 [2022-11-20 10:40:49,572 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-20 10:40:49,572 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 53 treesize of output 52 [2022-11-20 10:40:49,873 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:40:49,874 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 60 treesize of output 55 [2022-11-20 10:40:50,095 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 10:40:50,095 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 59 treesize of output 54 [2022-11-20 10:40:50,287 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:40:50,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 46 treesize of output 47 [2022-11-20 10:40:50,556 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:40:50,557 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 60 treesize of output 55 [2022-11-20 10:40:50,871 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 10:40:50,871 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 59 treesize of output 54 [2022-11-20 10:40:51,044 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:40:51,045 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 46 treesize of output 47 [2022-11-20 10:40:51,293 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:40:51,293 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 60 treesize of output 55 [2022-11-20 10:40:51,572 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 10:40:51,573 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 59 treesize of output 54 [2022-11-20 10:40:51,802 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:40:51,802 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 46 treesize of output 47 [2022-11-20 10:40:52,089 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:40:52,090 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 60 treesize of output 55 [2022-11-20 10:40:52,397 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 10:40:52,398 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 59 treesize of output 54 [2022-11-20 10:40:52,638 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:40:52,638 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 46 treesize of output 47 [2022-11-20 10:40:52,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:40:52,898 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 54 treesize of output 34 [2022-11-20 10:40:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:40:52,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:44:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 44 refuted. 56 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:44:52,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232937452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:44:52,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:44:52,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24, 27] total 66 [2022-11-20 10:44:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128446694] [2022-11-20 10:44:52,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:44:52,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-20 10:44:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-20 10:44:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=3232, Unknown=361, NotChecked=0, Total=4422 [2022-11-20 10:44:52,118 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 67 states, 66 states have (on average 2.196969696969697) internal successors, (145), 67 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:45:06,854 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1152 Int) (v_ArrVal_1162 Int) (v_ArrVal_1156 Int) (v_ArrVal_1166 Int) (v_ArrVal_1146 Int) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1150 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse17 (store (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1146)))) (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1150))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store (let ((.cse15 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1152)))) (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1155))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse11 (store (let ((.cse12 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1156)))) (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1160))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (let ((.cse9 (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (let ((.cse6 (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1152 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (< 0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (< (+ v_ArrVal_1162 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1166 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1146 1) .cse4) (< 0 (+ 2147483648 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_1156 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1166 Int)) (let ((.cse21 (store (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< 0 (+ (select (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1166 1) .cse4) (not (< 0 (select (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1152 Int) (v_ArrVal_1162 Int) (v_ArrVal_1156 Int) (v_ArrVal_1166 Int) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse36 (store (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1152)))) (store .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse38 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1155))) (let ((.cse24 (select .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse33 (store (let ((.cse34 (store .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1156)))) (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse35 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1160))) (let ((.cse26 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse30 (store (let ((.cse31 (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse32 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse25 (store (let ((.cse28 (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse29 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1156 1) (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (< (+ v_ArrVal_1162 1) (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1152 1) .cse4) (< (+ v_ArrVal_1166 1) (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1166 Int) (v_ArrVal_1165 (Array Int Int))) (let ((.cse43 (store (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse45 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse39 (select .cse43 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse40 (store (let ((.cse41 (store .cse43 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse42 (select .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse42 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse42 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1162 1) .cse4) (< (+ v_ArrVal_1166 1) (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))))) (<= 0 (+ .cse4 4)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1156 Int) (v_ArrVal_1166 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse54 (store (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1156)))) (store .cse55 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse56 (select .cse55 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse56 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse56 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1160))) (let ((.cse48 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse51 (store (let ((.cse52 (store .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse53 (select .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse46 (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse47 (store (let ((.cse49 (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1166 1) (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (< (+ v_ArrVal_1156 1) .cse4) (< (+ v_ArrVal_1162 1) (select .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:47:17,241 WARN L233 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 261 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:47:17,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1166 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1166 1) .cse1) (not (< 0 (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) (or (< 0 (+ .cse1 2147483648)) (not (< 0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1152 Int) (v_ArrVal_1162 Int) (v_ArrVal_1156 Int) (v_ArrVal_1166 Int) (v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse17 (store (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1152)))) (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1155))) (let ((.cse5 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store (let ((.cse15 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1156)))) (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1160))) (let ((.cse7 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse11 (store (let ((.cse12 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (let ((.cse9 (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1156 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (< (+ v_ArrVal_1162 1) (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1152 1) .cse1) (< (+ v_ArrVal_1166 1) (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1166 Int) (v_ArrVal_1165 (Array Int Int))) (let ((.cse24 (store (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse26 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse20 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse21 (store (let ((.cse22 (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse23 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1162 1) .cse1) (< (+ v_ArrVal_1166 1) (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1156 Int) (v_ArrVal_1166 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse35 (store (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1156)))) (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse37 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1160))) (let ((.cse29 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse32 (store (let ((.cse33 (store .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse34 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse27 (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse28 (store (let ((.cse30 (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse31 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1166 1) (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (< (+ v_ArrVal_1156 1) .cse1) (< (+ v_ArrVal_1162 1) (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:48:57,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1166 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1166 1) .cse1) (not (< 0 (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) (or (< 0 (+ .cse1 2147483648)) (not (< 0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1166 Int) (v_ArrVal_1165 (Array Int Int))) (let ((.cse9 (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (let ((.cse7 (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1162 1) .cse1) (< (+ v_ArrVal_1166 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1162 Int) (v_ArrVal_1156 Int) (v_ArrVal_1166 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse20 (store (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1156)))) (store .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse22 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1160))) (let ((.cse14 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store (let ((.cse18 (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1162)))) (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1165))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store (let ((.cse15 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1170))) (or (< (+ v_ArrVal_1166 1) (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (< 0 (select (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (< (+ v_ArrVal_1156 1) .cse1) (< (+ v_ArrVal_1162 1) (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false