./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro --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 b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- 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-8393723 [2022-11-18 18:23:46,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:23:46,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:23:46,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:23:46,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:23:46,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:23:46,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:23:46,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:23:46,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:23:46,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:23:46,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:23:46,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:23:46,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:23:46,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:23:46,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:23:46,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:23:46,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:23:46,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:23:46,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:23:46,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:23:46,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:23:46,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:23:46,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:23:46,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:23:46,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:23:46,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:23:46,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:23:46,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:23:46,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:23:46,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:23:46,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:23:46,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:23:46,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:23:46,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:23:46,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:23:46,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:23:46,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:23:46,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:23:46,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:23:46,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:23:46,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:23:46,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 18:23:46,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:23:46,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:23:46,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:23:46,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:23:46,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:23:46,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:23:46,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:23:46,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:23:46,375 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:23:46,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:23:46,377 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:23:46,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:23:46,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:23:46,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:23:46,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:23:46,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:23:46,378 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 18:23:46,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:23:46,379 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:23:46,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:23:46,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:23:46,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:23:46,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:23:46,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:23:46,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:23:46,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:23:46,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:23:46,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:23:46,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:23:46,383 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:23:46,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:23:46,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:23:46,384 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_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/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_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro 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 -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2022-11-18 18:23:46,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:23:46,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:23:46,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:23:46,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:23:46,776 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:23:46,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2022-11-18 18:23:46,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/data/0155eaa41/234875906a6f4766bc482b3d2002aba5/FLAGd797900bb [2022-11-18 18:23:47,561 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:23:47,562 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2022-11-18 18:23:47,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/data/0155eaa41/234875906a6f4766bc482b3d2002aba5/FLAGd797900bb [2022-11-18 18:23:47,824 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/data/0155eaa41/234875906a6f4766bc482b3d2002aba5 [2022-11-18 18:23:47,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:23:47,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:23:47,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:23:47,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:23:47,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:23:47,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:23:47" (1/1) ... [2022-11-18 18:23:47,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd70cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:47, skipping insertion in model container [2022-11-18 18:23:47,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:23:47" (1/1) ... [2022-11-18 18:23:47,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:23:47,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:23:48,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:23:48,323 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:23:48,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:23:48,436 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:23:48,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48 WrapperNode [2022-11-18 18:23:48,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:23:48,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:23:48,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:23:48,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:23:48,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,494 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-18 18:23:48,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:23:48,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:23:48,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:23:48,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:23:48,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,520 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:23:48,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:23:48,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:23:48,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:23:48,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (1/1) ... [2022-11-18 18:23:48,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:23:48,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:48,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:23:48,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:23:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:23:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:23:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:23:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:23:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:23:48,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:23:48,749 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:23:48,752 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:23:49,007 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:23:49,014 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:23:49,014 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 18:23:49,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:49 BoogieIcfgContainer [2022-11-18 18:23:49,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:23:49,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:23:49,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:23:49,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:23:49,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:23:47" (1/3) ... [2022-11-18 18:23:49,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d9ed06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:23:49, skipping insertion in model container [2022-11-18 18:23:49,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:48" (2/3) ... [2022-11-18 18:23:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d9ed06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:23:49, skipping insertion in model container [2022-11-18 18:23:49,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:49" (3/3) ... [2022-11-18 18:23:49,026 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09-no-inv_assume-alloca.i [2022-11-18 18:23:49,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:23:49,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-18 18:23:49,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:23:49,176 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;@5b99ac7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:23:49,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 18:23:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 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-18 18:23:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 18:23:49,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:49,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:49,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:23:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash 123263665, now seen corresponding path program 1 times [2022-11-18 18:23:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:49,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912620843] [2022-11-18 18:23:49,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:49,595 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-18 18:23:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912620843] [2022-11-18 18:23:49,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912620843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:49,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:49,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:23:49,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919975716] [2022-11-18 18:23:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:49,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:23:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:23:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:23:49,655 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-18 18:23:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:49,692 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-18 18:23:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:23:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-18 18:23:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:49,705 INFO L225 Difference]: With dead ends: 39 [2022-11-18 18:23:49,706 INFO L226 Difference]: Without dead ends: 16 [2022-11-18 18:23:49,709 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-18 18:23:49,714 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:49,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:23:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-18 18:23:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-18 18:23:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 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-18 18:23:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-11-18 18:23:49,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2022-11-18 18:23:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:49,755 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-11-18 18:23:49,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-18 18:23:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-11-18 18:23:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 18:23:49,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:49,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:49,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:23:49,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:23:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 180521967, now seen corresponding path program 1 times [2022-11-18 18:23:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:49,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195911913] [2022-11-18 18:23:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:50,533 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-18 18:23:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195911913] [2022-11-18 18:23:50,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195911913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:50,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:50,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:23:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256744194] [2022-11-18 18:23:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:23:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:50,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:23:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:23:50,548 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-18 18:23:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:50,666 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-18 18:23:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:23:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-18 18:23:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:50,668 INFO L225 Difference]: With dead ends: 28 [2022-11-18 18:23:50,668 INFO L226 Difference]: Without dead ends: 27 [2022-11-18 18:23:50,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:23:50,670 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:50,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:23:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-18 18:23:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-11-18 18:23:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-18 18:23:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-18 18:23:50,677 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2022-11-18 18:23:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:50,678 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-18 18:23:50,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-18 18:23:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-18 18:23:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 18:23:50,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:50,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:50,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:23:50,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:23:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1301211949, now seen corresponding path program 1 times [2022-11-18 18:23:50,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:50,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667924684] [2022-11-18 18:23:50,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:50,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:51,134 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-18 18:23:51,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:51,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667924684] [2022-11-18 18:23:51,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667924684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:51,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:51,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:23:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234157706] [2022-11-18 18:23:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:23:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:23:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:23:51,150 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-18 18:23:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:51,275 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-18 18:23:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:23:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-18 18:23:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:51,277 INFO L225 Difference]: With dead ends: 27 [2022-11-18 18:23:51,277 INFO L226 Difference]: Without dead ends: 25 [2022-11-18 18:23:51,279 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-18 18:23:51,286 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:51,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:23:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-18 18:23:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-18 18:23:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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-18 18:23:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-18 18:23:51,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2022-11-18 18:23:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:51,300 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-18 18:23:51,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-18 18:23:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-18 18:23:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 18:23:51,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:51,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:51,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:23:51,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:23:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1301213743, now seen corresponding path program 1 times [2022-11-18 18:23:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:51,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416775880] [2022-11-18 18:23:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:51,471 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-18 18:23:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:51,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416775880] [2022-11-18 18:23:51,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416775880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:51,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:51,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:23:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595889498] [2022-11-18 18:23:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:51,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:23:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:23:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:23:51,476 INFO L87 Difference]: Start difference. First operand 24 states and 27 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-18 18:23:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:51,546 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-18 18:23:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:23:51,547 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-18 18:23:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:51,549 INFO L225 Difference]: With dead ends: 25 [2022-11-18 18:23:51,550 INFO L226 Difference]: Without dead ends: 24 [2022-11-18 18:23:51,551 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-18 18:23:51,560 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:51,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:23:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-18 18:23:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-18 18:23:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 23 states have internal predecessors, (26), 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-18 18:23:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-18 18:23:51,565 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 9 [2022-11-18 18:23:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:51,565 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-18 18:23:51,565 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-18 18:23:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-18 18:23:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 18:23:51,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:51,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:51,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:23:51,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:23:51,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1319823166, now seen corresponding path program 1 times [2022-11-18 18:23:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:51,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651923878] [2022-11-18 18:23:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:52,477 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-18 18:23:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:52,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651923878] [2022-11-18 18:23:52,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651923878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:23:52,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203891991] [2022-11-18 18:23:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:52,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:23:52,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:52,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:23:52,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:23:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:52,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 18:23:52,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:23:53,649 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-18 18:23:53,651 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-18 18:23:53,752 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-18 18:23:53,856 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-18 18:23:53,932 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-18 18:23:54,261 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-18 18:23:59,512 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 3508 treesize of output 2822 [2022-11-18 18:24:01,153 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-18 18:24:01,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:01,516 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 19 treesize of output 3 [2022-11-18 18:24:06,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:06,569 INFO L321 Elim1Store]: treesize reduction 71, result has 25.3 percent of original size [2022-11-18 18:24:06,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 4242 treesize of output 3866 [2022-11-18 18:24:07,824 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-18 18:24:07,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:07,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 16 treesize of output 14 [2022-11-18 18:24:07,890 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:24:07,952 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:24:07,954 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:24:08,133 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-18 18:24:09,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:09,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 5 [2022-11-18 18:24:09,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:09,445 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 101 treesize of output 5 [2022-11-18 18:24:09,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:09,576 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 101 treesize of output 5 [2022-11-18 18:24:09,732 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 346 treesize of output 338 [2022-11-18 18:24:09,883 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 640 treesize of output 626 [2022-11-18 18:24:10,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:10,347 INFO L321 Elim1Store]: treesize reduction 39, result has 40.9 percent of original size [2022-11-18 18:24:10,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 3325 treesize of output 2991 [2022-11-18 18:24:10,678 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-18 18:24:10,818 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-18 18:24:11,454 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-18 18:24:12,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:12,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:12,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:12,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:12,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 7 [2022-11-18 18:24:12,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:12,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:12,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:12,633 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 127 treesize of output 3 [2022-11-18 18:24:12,641 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-18 18:24:16,365 INFO L321 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2022-11-18 18:24:16,365 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 872 treesize of output 787 [2022-11-18 18:24:16,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 758 treesize of output 754 [2022-11-18 18:24:16,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-11-18 18:24:16,623 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-18 18:24:16,648 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-18 18:24:16,698 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-18 18:24:16,851 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-18 18:24:16,882 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 22 [2022-11-18 18:24:16,985 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 35 treesize of output 35 [2022-11-18 18:24:17,220 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-18 18:24:17,221 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 68 treesize of output 77 [2022-11-18 18:24:17,287 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-18 18:24:17,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:17,469 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 34 treesize of output 22 [2022-11-18 18:24:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:17,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:17,676 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-18 18:24:17,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (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|))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-18 18:24:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 18:24:17,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203891991] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:17,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:17,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-18 18:24:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513600235] [2022-11-18 18:24:17,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:17,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 18:24:17,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:17,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 18:24:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=305, Unknown=9, NotChecked=74, Total=462 [2022-11-18 18:24:17,979 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-18 18:24:18,444 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse3 (<= .cse1 2147483647)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse14 (not .cse2))) (and (let ((.cse0 (<= .cse1 0))) (or (and (not .cse0) (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (and .cse0 |c_ULTIMATE.start_test_fun_#t~short7#1|))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or .cse2 .cse3) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select .cse19 0))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17)) (.cse13 (<= .cse5 0))) (or (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse7 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse4 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (and (= .cse4 .cse5) (= v_arrayElimArr_8 (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse4) 0 (select v_arrayElimArr_8 0))) (= v_DerPreprocessor_28 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse9 2147483647) (= .cse9 .cse1) (= v_prenex_88 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select v_DerPreprocessor_30 0) .cse5) (= .cse10 .cse1) (= v_prenex_99 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_19 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse10 2147483647) (= .cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))) .cse2 .cse13) (and .cse14 (exists ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse18 (store (store (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (let ((.cse15 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19)) (.cse16 (select (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse6 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse16 .cse1) (= (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse17) (<= .cse16 2147483647))))) .cse13) (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse25 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8)) (.cse21 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse22 (select .cse25 0))) (and (= v_arrayElimArr_8 (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse21) 0 (select v_arrayElimArr_8 0))) (= .cse22 .cse5) (= v_DerPreprocessor_28 (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse6 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (<= .cse22 0) (= v_prenex_88 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse21 .cse22)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_41 Int)) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (select .cse26 0)) (.cse28 (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_41) 0 v_DerPreprocessor_42) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse30 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (= v_prenex_99 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse28 .cse29) (= v_DerPreprocessor_19 (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse29 (select v_DerPreprocessor_30 0)) (= .cse29 .cse5) (<= .cse29 0) (= v_DerPreprocessor_41 .cse28) (= .cse6 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) .cse2) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) .cse13) (let ((.cse31 (select .cse17 0))) (and (<= .cse31 0) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse32 (store (store (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (let ((.cse33 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (and (= .cse17 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse6 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse17 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) .cse14 (= .cse5 .cse31) (= (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1))) (and (or (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3 .cse13) (and (exists ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_40 Int)) (let ((.cse34 (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_39) 0 v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= .cse34 0) (= .cse34 .cse5) (= .cse34 v_DerPreprocessor_39)))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse38 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse35 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse36 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (and (= .cse35 .cse1) (<= .cse35 2147483647) (= .cse6 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse17 (select .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse37 .cse17)))))))) .cse14))))) (or (and (= (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) .cse14) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))))) is different from true [2022-11-18 18:24:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:19,967 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-18 18:24:19,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 18:24:19,968 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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) Word has length 14 [2022-11-18 18:24:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:19,969 INFO L225 Difference]: With dead ends: 46 [2022-11-18 18:24:19,969 INFO L226 Difference]: Without dead ends: 45 [2022-11-18 18:24:19,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=165, Invalid=583, Unknown=20, NotChecked=162, Total=930 [2022-11-18 18:24:19,970 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:19,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 82 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2022-11-18 18:24:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-18 18:24:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-11-18 18:24:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 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-18 18:24:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-18 18:24:19,978 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 14 [2022-11-18 18:24:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:19,978 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-18 18:24:19,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-18 18:24:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-18 18:24:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 18:24:19,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:19,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:19,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:20,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:24:20,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156546, now seen corresponding path program 1 times [2022-11-18 18:24:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561974926] [2022-11-18 18:24:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:20,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:20,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561974926] [2022-11-18 18:24:20,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561974926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:20,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935541518] [2022-11-18 18:24:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:20,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:20,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:20,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:20,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:24:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:20,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 18:24:20,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:21,630 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-18 18:24:21,631 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-18 18:24:21,687 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-18 18:24:21,752 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-18 18:24:21,814 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-18 18:24:21,967 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-18 18:24:27,115 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 2269 treesize of output 2164 [2022-11-18 18:24:28,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:28,844 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-18 18:24:29,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:29,359 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-18 18:24:29,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:29,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:29,622 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:24:29,623 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 755 treesize of output 692 [2022-11-18 18:24:29,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 18:24:30,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:30,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:30,257 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:24:30,258 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 651 treesize of output 556 [2022-11-18 18:24:30,278 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 519 treesize of output 517 [2022-11-18 18:24:30,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 517 treesize of output 515 [2022-11-18 18:24:30,346 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 515 treesize of output 513 [2022-11-18 18:24:31,494 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 27 treesize of output 25 [2022-11-18 18:24:32,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,403 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 69 treesize of output 28 [2022-11-18 18:24:32,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 18:24:32,415 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-18 18:24:32,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:32,562 INFO L321 Elim1Store]: treesize reduction 38, result has 47.2 percent of original size [2022-11-18 18:24:32,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 665 treesize of output 746 [2022-11-18 18:24:32,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 5 treesize of output 3 [2022-11-18 18:24:32,929 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-18 18:24:32,993 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-18 18:24:33,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:33,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:33,808 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-18 18:24:33,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 33 [2022-11-18 18:24:33,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:33,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:33,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:33,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:33,903 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 113 treesize of output 12 [2022-11-18 18:24:40,802 INFO L321 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2022-11-18 18:24:40,804 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 3774 treesize of output 3371 [2022-11-18 18:24:41,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:41,609 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 12 treesize of output 10 [2022-11-18 18:24:41,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 24 treesize of output 21 [2022-11-18 18:24:41,693 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 47 treesize of output 45 [2022-11-18 18:24:42,028 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-18 18:24:42,028 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 55 treesize of output 76 [2022-11-18 18:24:42,081 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-18 18:24:42,102 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-18 18:24:42,193 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-18 18:24:42,668 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 49 treesize of output 32 [2022-11-18 18:24:42,760 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 28 treesize of output 12 [2022-11-18 18:24:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:42,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:44,048 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-18 18:24:44,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935541518] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:44,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:44,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2022-11-18 18:24:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315524212] [2022-11-18 18:24:44,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:44,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 18:24:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:44,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 18:24:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=550, Unknown=12, NotChecked=0, Total=702 [2022-11-18 18:24:44,051 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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-18 18:24:44,414 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (not .cse19)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse0 (not .cse1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse10 (= .cse18 0))) (or (and .cse2 (or (and (exists ((v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_502 (Array Int Int))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse6 (select (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_502 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= .cse6 v_DerPreprocessor_107) (= .cse6 0)))))) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_380 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45))) (and (= (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_379) (= (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse9) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0)))) .cse10) (and (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_506 (Array Int Int)) (v_prenex_507 (Array Int Int)) (v_prenex_502 (Array Int Int))) (let ((.cse13 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (select (store (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse11 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7))) (and (= v_prenex_502 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse12 v_DerPreprocessor_107) (= .cse12 0) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse13 .cse14) (= .cse13 (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse13 v_prenex_506))))) .cse10) (and .cse0 .cse10) (let ((.cse15 (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse15 0) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_506 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_prenex_507 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse17 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_97) (= .cse7 (store (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse15) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse18)) (= .cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse17 .cse14) (= .cse17 v_prenex_506)))))))) (and .cse19 .cse10 (or (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse20 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse20 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse14 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse20) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse22 v_prenex_453))))) (exists ((v_prenex_514 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse26 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse25 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_514) (= v_DerPreprocessor_101 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (and (exists ((v_prenex_459 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_457 (Array Int Int)) (v_prenex_458 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459)) (.cse28 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459))) (and (= v_DerPreprocessor_83 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= (select v_prenex_459 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_458)))) (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_prenex_377 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_378 (Array Int Int)) (v_prenex_511 (Array Int Int)) (v_prenex_512 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse30 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse29 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (= .cse14 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= v_DerPreprocessor_110 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_prenex_378 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_511)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse33 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse32 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse38 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse34 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse32 0) (= v_DerPreprocessor_110 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse37 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse35 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse36 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse14 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_prenex_456 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_455) (= v_prenex_516 .cse36) (= .cse14 (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse32) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= v_prenex_376 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse39 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse39 0) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse40 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse41 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_514 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse47 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse46 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse44 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse45 (select .cse46 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse42 .cse43) (= .cse14 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse42 v_prenex_455) (= v_prenex_516 .cse45) (= .cse14 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse39) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= .cse14 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse43 v_prenex_514))))) (= .cse14 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse48 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse54 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse53 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse48 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse51 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse49 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse50 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse14 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse48) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= (select .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse50 v_prenex_453))))) (= v_DerPreprocessor_110 (select .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_376 (select .cse54 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) (and .cse1 .cse10))))) .cse2 (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_230 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_230)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_230 .cse4))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2022-11-18 18:24:45,081 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse4 (not .cse19))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse0 (<= .cse1 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (not .cse2) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse11 (= .cse18 0))) (or (and .cse4 (or (and (exists ((v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_502 (Array Int Int))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_502 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= .cse7 v_DerPreprocessor_107) (= .cse7 0)))))) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_380 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45))) (and (= (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_379) (= (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse10) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0)))) .cse11) (and (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_506 (Array Int Int)) (v_prenex_507 (Array Int Int)) (v_prenex_502 (Array Int Int))) (let ((.cse14 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (and (= v_prenex_502 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse13 v_DerPreprocessor_107) (= .cse13 0) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse14 .cse3) (= .cse14 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 v_prenex_506))))) .cse11) (and .cse0 .cse11) (let ((.cse15 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse15 0) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_506 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_prenex_507 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse17 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_97) (= .cse8 (store (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse15) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse18)) (= .cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse17 .cse3) (= .cse17 v_prenex_506)))))))) (and .cse19 .cse11 (or (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse20 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse20 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse3 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse20) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse22 v_prenex_453))))) (exists ((v_prenex_514 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse26 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse25 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_514) (= v_DerPreprocessor_101 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (and (exists ((v_prenex_459 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_457 (Array Int Int)) (v_prenex_458 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459)) (.cse28 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459))) (and (= v_DerPreprocessor_83 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= (select v_prenex_459 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_458)))) (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_prenex_377 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_378 (Array Int Int)) (v_prenex_511 (Array Int Int)) (v_prenex_512 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse30 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse29 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (= .cse3 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= v_DerPreprocessor_110 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_prenex_378 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_511)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse33 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse32 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse38 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse34 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse32 0) (= v_DerPreprocessor_110 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse37 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse35 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse36 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse3 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_prenex_456 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_455) (= v_prenex_516 .cse36) (= .cse3 (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse32) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= v_prenex_376 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse39 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse39 0) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse40 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse41 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_514 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse47 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse46 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse44 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse45 (select .cse46 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse42 .cse43) (= .cse3 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse42 v_prenex_455) (= v_prenex_516 .cse45) (= .cse3 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse39) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= .cse3 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse43 v_prenex_514))))) (= .cse3 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse48 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse54 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse53 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse48 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse51 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse49 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse50 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse3 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse48) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= (select .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse50 v_prenex_453))))) (= v_DerPreprocessor_110 (select .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_376 (select .cse54 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) (and .cse2 .cse11))))) .cse4 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2022-11-18 18:24:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:45,934 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-18 18:24:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 18:24:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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) Word has length 15 [2022-11-18 18:24:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:45,936 INFO L225 Difference]: With dead ends: 76 [2022-11-18 18:24:45,936 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 18:24:45,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=350, Invalid=1204, Unknown=14, NotChecked=154, Total=1722 [2022-11-18 18:24:45,938 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:45,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 159 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2022-11-18 18:24:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 18:24:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2022-11-18 18:24:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 44 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-18 18:24:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-11-18 18:24:45,948 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 15 [2022-11-18 18:24:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:45,949 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-11-18 18:24:45,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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-18 18:24:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-11-18 18:24:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 18:24:45,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:45,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:45,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 18:24:46,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:46,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:24:46,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2035154752, now seen corresponding path program 1 times [2022-11-18 18:24:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:46,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161497680] [2022-11-18 18:24:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:46,567 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-18 18:24:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:46,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161497680] [2022-11-18 18:24:46,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161497680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:46,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016793982] [2022-11-18 18:24:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:46,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:46,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 18:24:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:46,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 18:24:46,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:46,822 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:24:46,822 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-18 18:24:46,841 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-18 18:24:46,859 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-18 18:24:46,876 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-18 18:24:47,182 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:24:47,182 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 228 treesize of output 197 [2022-11-18 18:24:47,245 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-18 18:24:47,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:24:47,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:47,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:47,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:47,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:47,477 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 78 treesize of output 23 [2022-11-18 18:24:47,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:24:47,487 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-18 18:24:49,016 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-18 18:24:49,016 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 820 treesize of output 785 [2022-11-18 18:24:49,259 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-18 18:24:49,268 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-18 18:24:49,311 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-18 18:24:49,336 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-18 18:24:49,374 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:24:49,380 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-18 18:24:49,392 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 18 treesize of output 15 [2022-11-18 18:24:49,410 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 18 treesize of output 15 [2022-11-18 18:24:49,548 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-18 18:24:49,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 18:24:49,804 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-18 18:24:49,804 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 61 treesize of output 72 [2022-11-18 18:24:49,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:49,851 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 49 treesize of output 51 [2022-11-18 18:24:49,931 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-18 18:24:49,936 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-18 18:24:49,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:50,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_293 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_293) |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-18 18:24:50,304 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-18 18:24:50,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016793982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:50,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:50,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-11-18 18:24:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387336812] [2022-11-18 18:24:50,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:50,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 18:24:50,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:50,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 18:24:50,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=409, Unknown=6, NotChecked=42, Total=552 [2022-11-18 18:24:50,309 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 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-18 18:24:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:51,484 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-11-18 18:24:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:24:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 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) Word has length 15 [2022-11-18 18:24:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:51,485 INFO L225 Difference]: With dead ends: 48 [2022-11-18 18:24:51,485 INFO L226 Difference]: Without dead ends: 47 [2022-11-18 18:24:51,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=157, Invalid=704, Unknown=13, NotChecked=56, Total=930 [2022-11-18 18:24:51,487 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:51,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 92 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-11-18 18:24:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-18 18:24:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-18 18:24:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 45 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-18 18:24:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-11-18 18:24:51,494 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 15 [2022-11-18 18:24:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:51,494 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-11-18 18:24:51,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 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-18 18:24:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-11-18 18:24:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:24:51,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:51,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:51,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:51,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 18:24:51,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:24:51,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1820880262, now seen corresponding path program 1 times [2022-11-18 18:24:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:51,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838349332] [2022-11-18 18:24:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:52,006 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-18 18:24:52,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:52,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838349332] [2022-11-18 18:24:52,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838349332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312170210] [2022-11-18 18:24:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:52,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:52,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:52,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 18:24:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:52,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-18 18:24:52,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:52,878 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-18 18:24:52,879 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-18 18:24:52,942 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-18 18:24:53,013 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-18 18:24:53,065 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-18 18:24:53,245 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-18 18:24:57,167 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 2189 treesize of output 1871 [2022-11-18 18:24:58,781 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-18 18:24:59,038 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-18 18:24:59,115 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-18 18:24:59,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:59,536 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 45 treesize of output 29 [2022-11-18 18:24:59,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:59,667 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 19 treesize of output 3 [2022-11-18 18:24:59,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:59,883 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 41 treesize of output 25 [2022-11-18 18:24:59,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:59,930 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 19 treesize of output 3 [2022-11-18 18:25:00,111 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 281 [2022-11-18 18:25:00,238 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-18 18:25:00,283 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-18 18:25:00,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:00,363 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 23 treesize of output 1 [2022-11-18 18:25:01,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:01,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:01,357 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:25:01,357 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 464 treesize of output 409 [2022-11-18 18:25:01,369 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-18 18:25:01,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:01,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:01,604 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 64 treesize of output 57 [2022-11-18 18:25:01,624 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-18 18:25:01,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:01,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:02,002 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:25:02,003 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 878 treesize of output 801 [2022-11-18 18:25:02,138 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-18 18:25:02,198 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-18 18:25:02,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:02,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:02,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:02,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:02,330 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 335 treesize of output 296 [2022-11-18 18:25:02,373 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:25:02,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:25:02,387 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:25:02,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:25:04,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 66 treesize of output 25 [2022-11-18 18:25:04,523 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-18 18:25:11,300 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 525 DAG size of output: 506 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:25:18,554 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 462 DAG size of output: 459 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:25:26,461 INFO L321 Elim1Store]: treesize reduction 42, result has 39.1 percent of original size [2022-11-18 18:25:26,461 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 501 treesize of output 454 [2022-11-18 18:25:26,519 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 72 treesize of output 62 [2022-11-18 18:25:26,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 57 treesize of output 53 [2022-11-18 18:25:26,666 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 72 treesize of output 62 [2022-11-18 18:25:26,675 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 57 treesize of output 53 [2022-11-18 18:25:26,768 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-18 18:25:26,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:26,890 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-18 18:25:26,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:26,909 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 51 treesize of output 47 [2022-11-18 18:25:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:26,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-18 18:25:27,386 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-18 18:25:27,386 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 95 treesize of output 86 [2022-11-18 18:25:27,392 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 84 treesize of output 80 [2022-11-18 18:25:27,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:25:27,797 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 60 treesize of output 36 [2022-11-18 18:25:27,822 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-18 18:25:27,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:28,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-18 18:25:28,140 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (not (<= (+ v_ArrVal_356 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)))))) is different from false [2022-11-18 18:25:28,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (< 2147483647 v_ArrVal_356))))) is different from false [2022-11-18 18:25:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-18 18:25:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312170210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:28,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-11-18 18:25:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675195636] [2022-11-18 18:25:28,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 18:25:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 18:25:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=409, Unknown=15, NotChecked=138, Total=702 [2022-11-18 18:25:28,553 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 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-18 18:25:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:34,502 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-11-18 18:25:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:25:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 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-18 18:25:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:34,503 INFO L225 Difference]: With dead ends: 51 [2022-11-18 18:25:34,503 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 18:25:34,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=213, Invalid=580, Unknown=31, NotChecked=168, Total=992 [2022-11-18 18:25:34,504 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:34,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-11-18 18:25:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 18:25:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-18 18:25:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 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-18 18:25:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-11-18 18:25:34,515 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 16 [2022-11-18 18:25:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:34,516 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-11-18 18:25:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 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-18 18:25:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-11-18 18:25:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 18:25:34,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:34,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:34,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 18:25:34,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 18:25:34,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:25:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594942, now seen corresponding path program 1 times [2022-11-18 18:25:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732927544] [2022-11-18 18:25:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:35,104 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-18 18:25:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:35,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732927544] [2022-11-18 18:25:35,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732927544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:35,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431658886] [2022-11-18 18:25:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:35,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:35,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:35,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:35,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 18:25:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:35,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 18:25:35,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:35,408 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:25:35,409 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-18 18:25:35,428 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-18 18:25:35,447 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-18 18:25:35,464 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-18 18:25:35,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:35,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:35,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:35,546 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-18 18:25:35,556 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-18 18:25:35,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:35,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:35,642 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 18:25:35,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 96 [2022-11-18 18:25:35,674 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-18 18:25:35,691 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-18 18:25:35,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:35,774 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-18 18:25:35,780 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-18 18:25:36,520 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-18 18:25:36,520 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 422 treesize of output 405 [2022-11-18 18:25:36,639 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-18 18:25:36,644 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-18 18:25:36,661 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-18 18:25:36,762 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 28 treesize of output 16 [2022-11-18 18:25:36,831 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-18 18:25:36,861 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-18 18:25:36,864 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-18 18:25:36,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:36,900 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |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-18 18:25:36,924 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_425 Int)) (or (not (<= v_ArrVal_425 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (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_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |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-18 18:25:36,944 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |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-18 18:25:36,958 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |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_425))))) is different from false [2022-11-18 18:25:37,008 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |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_425))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-18 18:25:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-18 18:25:37,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431658886] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:37,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:37,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-18 18:25:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865622323] [2022-11-18 18:25:37,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:37,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 18:25:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 18:25:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=202, Unknown=8, NotChecked=170, Total=462 [2022-11-18 18:25:37,033 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 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-18 18:25:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:37,725 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-11-18 18:25:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:25:37,726 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 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-18 18:25:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:37,729 INFO L225 Difference]: With dead ends: 55 [2022-11-18 18:25:37,729 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 18:25:37,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=20, NotChecked=230, Total=756 [2022-11-18 18:25:37,730 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:37,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-11-18 18:25:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 18:25:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-11-18 18:25:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 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-18 18:25:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-11-18 18:25:37,743 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2022-11-18 18:25:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:37,744 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-11-18 18:25:37,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 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-18 18:25:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-11-18 18:25:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 18:25:37,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:37,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:37,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 18:25:37,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:37,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:25:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash -612715006, now seen corresponding path program 2 times [2022-11-18 18:25:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:37,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889848065] [2022-11-18 18:25:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:38,267 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-18 18:25:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:38,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889848065] [2022-11-18 18:25:38,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889848065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906038933] [2022-11-18 18:25:38,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:25:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:38,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:38,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 18:25:38,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:25:38,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:25:38,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-18 18:25:38,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:38,419 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-18 18:25:38,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:38,576 INFO L321 Elim1Store]: treesize reduction 78, result has 48.0 percent of original size [2022-11-18 18:25:38,576 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 234 treesize of output 289 [2022-11-18 18:25:38,594 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-18 18:25:38,616 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-18 18:25:38,664 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-18 18:25:38,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:38,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:38,710 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 93 treesize of output 86 [2022-11-18 18:25:38,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:38,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:38,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 89 treesize of output 80 [2022-11-18 18:25:38,862 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:25:38,862 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 117 treesize of output 86 [2022-11-18 18:25:39,010 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-18 18:25:39,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:39,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:39,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-18 18:25:39,467 INFO L321 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2022-11-18 18:25:39,468 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 46 treesize of output 40 [2022-11-18 18:25:39,589 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-18 18:25:39,590 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 34 treesize of output 39 [2022-11-18 18:25:39,652 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 18:25:39,652 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 19 [2022-11-18 18:25:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:39,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906038933] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:40,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:40,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2022-11-18 18:25:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695985674] [2022-11-18 18:25:40,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:40,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 18:25:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 18:25:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=502, Unknown=13, NotChecked=0, Total=600 [2022-11-18 18:25:40,268 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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-18 18:25:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:40,832 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-11-18 18:25:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:25:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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-18 18:25:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:40,833 INFO L225 Difference]: With dead ends: 71 [2022-11-18 18:25:40,833 INFO L226 Difference]: Without dead ends: 59 [2022-11-18 18:25:40,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1034, Unknown=13, NotChecked=0, Total=1260 [2022-11-18 18:25:40,835 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:40,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2022-11-18 18:25:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-18 18:25:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-11-18 18:25:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 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-18 18:25:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-11-18 18:25:40,847 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 17 [2022-11-18 18:25:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:40,847 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-11-18 18:25:40,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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-18 18:25:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-11-18 18:25:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 18:25:40,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:40,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:40,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 18:25:41,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:41,054 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:25:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash -612713212, now seen corresponding path program 1 times [2022-11-18 18:25:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:41,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67360793] [2022-11-18 18:25:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:41,345 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-18 18:25:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:41,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67360793] [2022-11-18 18:25:41,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67360793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:41,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490175732] [2022-11-18 18:25:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:41,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:41,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 18:25:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:41,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 18:25:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:41,630 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:25:41,631 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-18 18:25:41,644 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-18 18:25:41,662 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-18 18:25:41,677 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-18 18:25:42,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:42,206 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 63 treesize of output 30 [2022-11-18 18:25:42,211 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 23 treesize of output 21 [2022-11-18 18:25:42,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:42,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:42,266 INFO L321 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-11-18 18:25:42,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 165 [2022-11-18 18:25:42,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:42,433 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 68 treesize of output 11 [2022-11-18 18:25:42,645 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-18 18:25:42,646 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 36 treesize of output 31 [2022-11-18 18:25:42,704 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 21 treesize of output 21 [2022-11-18 18:25:42,739 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-18 18:25:42,743 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-18 18:25:42,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:42,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559) |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-18 18:25:43,071 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-18 18:25:43,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490175732] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:43,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:43,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2022-11-18 18:25:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191630010] [2022-11-18 18:25:43,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:43,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 18:25:43,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:43,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 18:25:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=373, Unknown=7, NotChecked=42, Total=552 [2022-11-18 18:25:43,074 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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-18 18:25:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:43,280 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-11-18 18:25:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:25:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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-18 18:25:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:43,281 INFO L225 Difference]: With dead ends: 58 [2022-11-18 18:25:43,281 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 18:25:43,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=486, Unknown=7, NotChecked=48, Total=702 [2022-11-18 18:25:43,282 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:43,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 82 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2022-11-18 18:25:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 18:25:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-11-18 18:25:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 54 states have internal predecessors, (64), 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-18 18:25:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-11-18 18:25:43,294 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 17 [2022-11-18 18:25:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:43,295 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-11-18 18:25:43,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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-18 18:25:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-11-18 18:25:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:25:43,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:43,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:43,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-18 18:25:43,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 18:25:43,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:25:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1536802878, now seen corresponding path program 1 times [2022-11-18 18:25:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:43,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142083561] [2022-11-18 18:25:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:43,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142083561] [2022-11-18 18:25:43,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142083561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:43,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665773935] [2022-11-18 18:25:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:43,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:43,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 18:25:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:43,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 18:25:43,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:44,099 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:25:44,100 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-18 18:25:44,115 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-18 18:25:44,132 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-18 18:25:44,153 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-18 18:25:44,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,234 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 18:25:44,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 112 [2022-11-18 18:25:44,259 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-18 18:25:44,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,309 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 103 treesize of output 92 [2022-11-18 18:25:44,316 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-18 18:25:44,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,397 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 45 treesize of output 9 [2022-11-18 18:25:44,402 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-18 18:25:44,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:44,449 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 59 treesize of output 20 [2022-11-18 18:25:44,454 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-18 18:25:45,163 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-18 18:25:45,163 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 773 treesize of output 753 [2022-11-18 18:25:45,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 7 treesize of output 5 [2022-11-18 18:25:45,434 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-18 18:25:45,451 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-18 18:25:45,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 18:25:45,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 11 treesize of output 7 [2022-11-18 18:25:45,551 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 24 treesize of output 20 [2022-11-18 18:25:45,649 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-18 18:25:45,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 18:25:45,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 18:25:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:45,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:45,877 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_626) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))) is different from false [2022-11-18 18:25:45,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:25:45,901 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 20 treesize of output 21 [2022-11-18 18:25:45,904 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 35 treesize of output 27 [2022-11-18 18:25:45,909 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-18 18:25:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 18:25:46,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665773935] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:46,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:46,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-18 18:25:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883789227] [2022-11-18 18:25:46,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:46,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 18:25:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:46,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 18:25:46,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=423, Unknown=32, NotChecked=44, Total=600 [2022-11-18 18:25:46,122 INFO L87 Difference]: Start difference. First operand 55 states and 64 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-18 18:25:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:46,972 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-18 18:25:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:25:46,973 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-18 18:25:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:46,974 INFO L225 Difference]: With dead ends: 65 [2022-11-18 18:25:46,974 INFO L226 Difference]: Without dead ends: 64 [2022-11-18 18:25:46,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=908, Unknown=62, NotChecked=66, Total=1260 [2022-11-18 18:25:46,975 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:46,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 109 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 93 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-11-18 18:25:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-18 18:25:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-11-18 18:25:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 56 states have internal predecessors, (66), 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-18 18:25:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-11-18 18:25:46,987 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 18 [2022-11-18 18:25:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:46,987 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-11-18 18:25:46,988 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-18 18:25:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-11-18 18:25:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 18:25:46,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:46,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:25:46,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 18:25:47,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 18:25:47,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:25:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2081214775, now seen corresponding path program 1 times [2022-11-18 18:25:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:47,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690338737] [2022-11-18 18:25:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:25:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690338737] [2022-11-18 18:25:47,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690338737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363801102] [2022-11-18 18:25:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:47,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:47,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 18:25:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:47,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 18:25:47,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:48,401 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-18 18:25:48,402 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-18 18:25:48,465 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-18 18:25:48,545 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-18 18:25:48,628 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-18 18:25:48,807 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-18 18:25:48,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:48,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:48,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:48,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:48,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:48,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:48,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,001 INFO L217 Elim1Store]: Index analysis took 106 ms [2022-11-18 18:25:49,050 INFO L321 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2022-11-18 18:25:49,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 227 treesize of output 694 [2022-11-18 18:25:49,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,582 INFO L217 Elim1Store]: Index analysis took 265 ms [2022-11-18 18:25:49,646 INFO L321 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2022-11-18 18:25:49,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 229 treesize of output 694 [2022-11-18 18:25:49,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:49,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:50,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:50,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:50,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:50,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 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 189 treesize of output 648 [2022-11-18 18:25:52,931 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 2326 treesize of output 1990 [2022-11-18 18:25:54,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:54,316 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 29 treesize of output 7 [2022-11-18 18:25:54,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:54,453 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 29 treesize of output 7 [2022-11-18 18:25:54,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:25:54,611 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 29 treesize of output 7 [2022-11-18 18:25:55,192 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-18 18:25:55,314 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 534 treesize of output 528 [2022-11-18 18:25:59,875 INFO L321 Elim1Store]: treesize reduction 366, result has 29.2 percent of original size [2022-11-18 18:25:59,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 11 new quantified variables, introduced 35 case distinctions, treesize of input 6697 treesize of output 8643 [2022-11-18 18:26:01,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:26:01,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-18 18:26:01,898 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-18 18:26:02,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:26:02,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-18 18:26:02,227 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-18 18:26:02,596 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:26:02,887 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 45 treesize of output 41 [2022-11-18 18:26:03,441 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 45 treesize of output 41 [2022-11-18 18:26:03,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-18 18:26:03,914 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-18 18:26:04,179 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-18 18:26:04,282 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 45 treesize of output 41 [2022-11-18 18:26:18,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:26:19,547 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 24 treesize of output 18 [2022-11-18 18:26:19,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 24 treesize of output 18 [2022-11-18 18:26:20,445 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 360 treesize of output 354 [2022-11-18 18:26:20,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-18 18:26:20,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 743 treesize of output 735 [2022-11-18 18:26:45,197 WARN L233 SmtUtils]: Spent 9.15s on a formula simplification. DAG size of input: 252 DAG size of output: 170 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-18 18:26:45,197 INFO L321 Elim1Store]: treesize reduction 740, result has 50.6 percent of original size [2022-11-18 18:26:45,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 12 new quantified variables, introduced 39 case distinctions, treesize of input 14762 treesize of output 19079 [2022-11-18 18:30:43,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:44,387 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-11-18 18:30:44,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3168 treesize of output 2447 [2022-11-18 18:30:47,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:47,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:47,779 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 18:30:47,779 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 1 case distinctions, treesize of input 2799 treesize of output 27 [2022-11-18 18:30:47,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:47,785 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 29 treesize of output 7 [2022-11-18 18:30:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:30:47,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:30:47,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:48,045 INFO L321 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2022-11-18 18:30:48,046 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 3563 treesize of output 1232 [2022-11-18 18:30:48,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:49,464 INFO L321 Elim1Store]: treesize reduction 38, result has 87.8 percent of original size [2022-11-18 18:30:49,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 16338 treesize of output 6501 [2022-11-18 18:30:53,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:30:53,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:30:53,996 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 954 treesize of output 77 [2022-11-18 18:30:59,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:30:59,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:30:59,262 INFO L321 Elim1Store]: treesize reduction 614, result has 0.2 percent of original size [2022-11-18 18:30:59,263 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 9811 treesize of output 876 [2022-11-18 18:31:00,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:00,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:00,425 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-18 18:31:00,426 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 2095 treesize of output 1397 [2022-11-18 18:31:03,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:03,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:04,239 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 3486 treesize of output 3005 [2022-11-18 18:31:08,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:08,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:08,728 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 0 case distinctions, treesize of input 3479 treesize of output 23 [2022-11-18 18:31:08,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:08,733 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 29 treesize of output 7 [2022-11-18 18:31:08,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:08,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:08,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:08,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:08,883 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 732 treesize of output 365 [2022-11-18 18:31:31,604 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 18:31:31,605 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 2795 treesize of output 2496 [2022-11-18 18:31:31,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-18 18:31:32,166 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 18:31:32,166 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 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 18:31:32,445 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 21 treesize of output 21 [2022-11-18 18:31:32,498 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 21 treesize of output 21 [2022-11-18 18:31:32,938 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 33 treesize of output 13 [2022-11-18 18:31:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:32,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:31:33,528 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_700))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-18 18:31:33,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_699) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_700))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-18 18:31:33,816 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_699) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_700))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)))))) is different from false [2022-11-18 18:31:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-18 18:31:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363801102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:31:34,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:31:34,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2022-11-18 18:31:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281981180] [2022-11-18 18:31:34,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:31:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 18:31:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:31:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 18:31:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=478, Unknown=26, NotChecked=144, Total=756 [2022-11-18 18:31:34,489 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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-18 18:31:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:31:44,768 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-11-18 18:31:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 18:31:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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 22 [2022-11-18 18:31:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:31:44,769 INFO L225 Difference]: With dead ends: 74 [2022-11-18 18:31:44,769 INFO L226 Difference]: Without dead ends: 73 [2022-11-18 18:31:44,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=255, Invalid=1122, Unknown=41, NotChecked=222, Total=1640 [2022-11-18 18:31:44,771 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:31:44,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 101 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 192 Unchecked, 0.1s Time] [2022-11-18 18:31:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-18 18:31:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-11-18 18:31:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 64 states have internal predecessors, (77), 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-18 18:31:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-18 18:31:44,783 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2022-11-18 18:31:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:31:44,784 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-18 18:31:44,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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-18 18:31:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-18 18:31:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:31:44,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:31:44,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:31:44,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 18:31:44,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 18:31:44,991 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:31:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:31:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -93150317, now seen corresponding path program 3 times [2022-11-18 18:31:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:31:44,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765324227] [2022-11-18 18:31:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:31:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:31:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:31:45,362 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-18 18:31:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:31:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765324227] [2022-11-18 18:31:45,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765324227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:31:45,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630884797] [2022-11-18 18:31:45,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:31:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:31:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:31:45,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:31:45,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 18:31:45,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 18:31:45,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:31:45,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 18:31:45,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:31:45,653 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:31:45,653 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-18 18:31:45,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 8 treesize of output 7 [2022-11-18 18:31:45,679 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-18 18:31:45,691 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-18 18:31:45,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:45,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:45,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:45,756 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-18 18:31:45,761 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-18 18:31:45,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:45,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:45,838 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-18 18:31:45,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 98 [2022-11-18 18:31:45,862 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-18 18:31:45,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:45,879 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-18 18:31:45,882 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-18 18:31:45,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:45,928 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:31:45,928 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 59 treesize of output 20 [2022-11-18 18:31:45,933 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-18 18:31:46,203 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 18:31:46,204 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 388 treesize of output 362 [2022-11-18 18:31:46,276 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-18 18:31:46,318 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-18 18:31:46,334 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-18 18:31:46,347 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-18 18:31:46,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-11-18 18:31:46,654 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:31:46,654 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 2 case distinctions, treesize of input 32 treesize of output 35 [2022-11-18 18:31:46,756 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 18:31:46,756 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 24 treesize of output 29 [2022-11-18 18:31:46,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:31:46,811 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 32 treesize of output 24 [2022-11-18 18:31:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 18:31:46,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:31:47,098 INFO L321 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2022-11-18 18:31:47,098 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 44 [2022-11-18 18:31:47,107 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 18:31:47,108 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 87 treesize of output 63 [2022-11-18 18:31:47,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:31:47,116 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 58 treesize of output 58 [2022-11-18 18:31:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 3 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 18:31:47,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630884797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:31:47,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:31:47,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-18 18:31:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619441586] [2022-11-18 18:31:47,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:31:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 18:31:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:31:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 18:31:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=542, Unknown=12, NotChecked=0, Total=650 [2022-11-18 18:31:47,475 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-18 18:31:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:31:48,667 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2022-11-18 18:31:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 18:31:48,675 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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 23 [2022-11-18 18:31:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:31:48,675 INFO L225 Difference]: With dead ends: 102 [2022-11-18 18:31:48,675 INFO L226 Difference]: Without dead ends: 68 [2022-11-18 18:31:48,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=534, Invalid=1904, Unknown=12, NotChecked=0, Total=2450 [2022-11-18 18:31:48,677 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 226 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:31:48,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 29 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2022-11-18 18:31:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-18 18:31:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2022-11-18 18:31:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 states have internal predecessors, (40), 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-18 18:31:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-11-18 18:31:48,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2022-11-18 18:31:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:31:48,689 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-11-18 18:31:48,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-18 18:31:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-11-18 18:31:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:31:48,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:31:48,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:31:48,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 18:31:48,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 18:31:48,896 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:31:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:31:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -93148523, now seen corresponding path program 1 times [2022-11-18 18:31:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:31:48,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167643905] [2022-11-18 18:31:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:31:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:31:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:31:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:49,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:31:49,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167643905] [2022-11-18 18:31:49,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167643905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:31:49,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978458695] [2022-11-18 18:31:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:31:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:31:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:31:49,366 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:31:49,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 18:31:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:31:49,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 18:31:49,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:31:49,641 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:31:49,641 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-18 18:31:49,656 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-18 18:31:49,674 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-18 18:31:49,689 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-18 18:31:49,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:49,810 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-11-18 18:31:49,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 103 [2022-11-18 18:31:49,829 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-18 18:31:49,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:49,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:49,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:49,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:49,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2022-11-18 18:31:49,880 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-18 18:31:49,910 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:31:49,911 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 59 treesize of output 20 [2022-11-18 18:31:49,915 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-18 18:31:51,101 INFO L321 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2022-11-18 18:31:51,101 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 464 treesize of output 455 [2022-11-18 18:31:51,140 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-18 18:31:51,192 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-18 18:31:51,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:31:51,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 18:31:51,221 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 18 treesize of output 15 [2022-11-18 18:31:51,279 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-18 18:31:51,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 18:31:51,559 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-18 18:31:51,559 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 61 treesize of output 72 [2022-11-18 18:31:51,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:31:51,600 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 49 treesize of output 51 [2022-11-18 18:31:51,757 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 28 treesize of output 16 [2022-11-18 18:31:51,815 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-18 18:31:51,858 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-18 18:31:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:51,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:31:51,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int))) (< 0 (+ 2147483648 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))) is different from false [2022-11-18 18:31:54,019 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_848 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |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-18 18:31:54,043 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_846))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_848 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-18 18:31:54,079 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 Int) (v_ArrVal_844 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_846))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_848 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (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|) v_ArrVal_844))))))) is different from false [2022-11-18 18:31:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-18 18:31:54,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978458695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:31:54,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:31:54,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2022-11-18 18:31:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920236097] [2022-11-18 18:31:54,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:31:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 18:31:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:31:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 18:31:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=662, Unknown=11, NotChecked=228, Total=1056 [2022-11-18 18:31:54,316 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 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-18 18:31:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:31:55,590 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-18 18:31:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:31:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 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 23 [2022-11-18 18:31:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:31:55,591 INFO L225 Difference]: With dead ends: 56 [2022-11-18 18:31:55,591 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 18:31:55,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=234, Invalid=1097, Unknown=17, NotChecked=292, Total=1640 [2022-11-18 18:31:55,593 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:31:55,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 105 Unchecked, 0.0s Time] [2022-11-18 18:31:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 18:31:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-11-18 18:31:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 53 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-18 18:31:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-18 18:31:55,604 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 23 [2022-11-18 18:31:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:31:55,605 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-18 18:31:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 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-18 18:31:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-18 18:31:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 18:31:55,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:31:55,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-18 18:31:55,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 18:31:55,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 18:31:55,811 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:31:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:31:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1427316007, now seen corresponding path program 2 times [2022-11-18 18:31:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:31:55,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161061890] [2022-11-18 18:31:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:31:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:31:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:31:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:31:56,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161061890] [2022-11-18 18:31:56,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161061890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:31:56,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944504982] [2022-11-18 18:31:56,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:31:56,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:31:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:31:56,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:31:56,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 18:31:56,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:31:56,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:31:56,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 18:31:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:31:56,594 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:31:56,595 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-18 18:31:56,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 8 treesize of output 7 [2022-11-18 18:31:56,627 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-18 18:31:56,643 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-18 18:31:57,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:31:57,180 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 66 treesize of output 35 [2022-11-18 18:31:57,184 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 29 treesize of output 27 [2022-11-18 18:31:57,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:57,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:31:57,228 INFO L321 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-11-18 18:31:57,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 165 [2022-11-18 18:31:57,581 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-18 18:31:57,581 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 36 treesize of output 31 [2022-11-18 18:31:57,637 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 21 treesize of output 21 [2022-11-18 18:31:57,722 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 28 treesize of output 16 [2022-11-18 18:31:57,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 18:31:57,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 18:31:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:57,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:31:57,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |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-18 18:31:57,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_921 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-18 18:31:58,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_918 1))) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |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-18 18:31:58,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (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_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_918 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-18 18:31:58,060 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (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_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_918 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-18 18:31:58,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (= .cse0 0) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_918 1) .cse0)))))))) is different from false [2022-11-18 18:31:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-18 18:31:58,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944504982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:31:58,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:31:58,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 33 [2022-11-18 18:31:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974689863] [2022-11-18 18:31:58,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:31:58,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 18:31:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:31:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 18:31:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=573, Unknown=11, NotChecked=342, Total=1122 [2022-11-18 18:31:58,176 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 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-18 18:31:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:31:58,819 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-11-18 18:31:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 18:31:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 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-18 18:31:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:31:58,821 INFO L225 Difference]: With dead ends: 64 [2022-11-18 18:31:58,821 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 18:31:58,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=868, Unknown=11, NotChecked=414, Total=1560 [2022-11-18 18:31:58,822 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:31:58,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 188 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 261 Unchecked, 0.2s Time] [2022-11-18 18:31:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 18:31:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-18 18:31:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 61 states have internal predecessors, (64), 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-18 18:31:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-11-18 18:31:58,843 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 25 [2022-11-18 18:31:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:31:58,843 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-11-18 18:31:58,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 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-18 18:31:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-11-18 18:31:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 18:31:58,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:31:58,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 18:31:58,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 18:31:59,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:31:59,053 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:31:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:31:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -438711859, now seen corresponding path program 2 times [2022-11-18 18:31:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:31:59,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610537062] [2022-11-18 18:31:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:31:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:31:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:31:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:31:59,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:31:59,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610537062] [2022-11-18 18:31:59,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610537062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:31:59,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131977243] [2022-11-18 18:31:59,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:31:59,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:31:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:31:59,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:31:59,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 18:31:59,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:31:59,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:31:59,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 18:31:59,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:31:59,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 18:31:59,716 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 18:31:59,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-18 18:31:59,724 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-18 18:31:59,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-18 18:31:59,971 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 18:31:59,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-11-18 18:32:00,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 18:32:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:00,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:00,325 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (v_ArrVal_994 Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse2 (store |c_#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_992))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< v_ArrVal_994 (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1)) (< 0 (+ (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_994)))) (store .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_996))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483650)) (< (+ v_ArrVal_996 2147483648) 0))))) is different from false [2022-11-18 18:32:00,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:32:00,411 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 98 treesize of output 66 [2022-11-18 18:32:00,418 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 172 treesize of output 166 [2022-11-18 18:32:00,426 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 178 treesize of output 172 [2022-11-18 18:32:00,437 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 105 treesize of output 101 [2022-11-18 18:32:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-18 18:32:00,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131977243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:00,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:32:00,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2022-11-18 18:32:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130069233] [2022-11-18 18:32:00,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:00,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 18:32:00,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:32:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 18:32:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=446, Unknown=1, NotChecked=44, Total=600 [2022-11-18 18:32:00,498 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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-18 18:32:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:01,002 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-18 18:32:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:32:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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) Word has length 26 [2022-11-18 18:32:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:01,003 INFO L225 Difference]: With dead ends: 62 [2022-11-18 18:32:01,004 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 18:32:01,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=748, Unknown=1, NotChecked=60, Total=1056 [2022-11-18 18:32:01,004 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 82 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:01,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 32 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 64 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-18 18:32:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 18:32:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-18 18:32:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 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-18 18:32:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-11-18 18:32:01,018 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 26 [2022-11-18 18:32:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:01,018 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-11-18 18:32:01,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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-18 18:32:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-11-18 18:32:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 18:32:01,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:01,020 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:01,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-18 18:32:01,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 18:32:01,225 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:32:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 946515818, now seen corresponding path program 2 times [2022-11-18 18:32:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:32:01,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676712598] [2022-11-18 18:32:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:32:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:01,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:32:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676712598] [2022-11-18 18:32:01,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676712598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:32:01,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482949048] [2022-11-18 18:32:01,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:32:01,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:32:01,903 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:32:01,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 18:32:02,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:32:02,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:32:02,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 18:32:02,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:02,210 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:32:02,210 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-18 18:32:02,225 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-18 18:32:02,241 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-18 18:32:02,255 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-18 18:32:02,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:02,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:02,516 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-18 18:32:02,516 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 92 treesize of output 83 [2022-11-18 18:32:02,521 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-18 18:32:02,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:02,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:02,558 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:32:02,558 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 251 treesize of output 216 [2022-11-18 18:32:02,579 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-18 18:32:02,673 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-18 18:32:02,686 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-18 18:32:02,733 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:32:02,733 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 96 treesize of output 25 [2022-11-18 18:32:02,737 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-18 18:32:03,101 INFO L321 Elim1Store]: treesize reduction 52, result has 40.2 percent of original size [2022-11-18 18:32:03,101 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 40 treesize of output 54 [2022-11-18 18:32:03,180 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 18:32:03,181 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 21 treesize of output 25 [2022-11-18 18:32:03,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 18:32:03,330 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-18 18:32:03,403 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 28 treesize of output 16 [2022-11-18 18:32:03,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 18:32:03,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 18:32:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:03,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:03,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |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-18 18:32:05,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1079 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1079 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |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-18 18:32:05,639 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1079 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |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-18 18:32:05,669 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1077 1))) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-18 18:32:05,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1077 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1079 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-18 18:32:05,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1075))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1077 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |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-18 18:32:05,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1073 Int) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1073)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1075))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1077 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (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|) v_ArrVal_1073)))))))) is different from false [2022-11-18 18:32:05,849 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1073 Int) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1073)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1075))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1077 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (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|) v_ArrVal_1073)))))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-18 18:32:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-18 18:32:05,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482949048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:05,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:32:05,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 38 [2022-11-18 18:32:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663450137] [2022-11-18 18:32:05,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:05,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-18 18:32:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:32:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-18 18:32:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=718, Unknown=14, NotChecked=520, Total=1482 [2022-11-18 18:32:05,958 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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-18 18:32:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:06,667 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-11-18 18:32:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 18:32:06,667 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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 31 [2022-11-18 18:32:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:06,668 INFO L225 Difference]: With dead ends: 72 [2022-11-18 18:32:06,668 INFO L226 Difference]: Without dead ends: 71 [2022-11-18 18:32:06,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=343, Invalid=1081, Unknown=14, NotChecked=632, Total=2070 [2022-11-18 18:32:06,669 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:06,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 79 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 252 Unchecked, 0.1s Time] [2022-11-18 18:32:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-18 18:32:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2022-11-18 18:32:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 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-18 18:32:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-11-18 18:32:06,682 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2022-11-18 18:32:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:06,682 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-11-18 18:32:06,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 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-18 18:32:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-11-18 18:32:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 18:32:06,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:06,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:06,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 18:32:06,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 18:32:06,889 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:32:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:06,890 INFO L85 PathProgramCache]: Analyzing trace with hash -931363604, now seen corresponding path program 4 times [2022-11-18 18:32:06,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:32:06,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039617214] [2022-11-18 18:32:06,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:06,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:32:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:07,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:32:07,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039617214] [2022-11-18 18:32:07,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039617214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:32:07,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163287999] [2022-11-18 18:32:07,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 18:32:07,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:07,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:32:07,404 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:32:07,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 18:32:07,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 18:32:07,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:32:07,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 18:32:07,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:07,676 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:32:07,676 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-18 18:32:07,689 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-18 18:32:07,704 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-18 18:32:07,717 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-18 18:32:07,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:32:07,971 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-18 18:32:07,971 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 329 treesize of output 298 [2022-11-18 18:32:08,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:32:08,059 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-18 18:32:09,394 INFO L321 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-11-18 18:32:09,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 870 treesize of output 901 [2022-11-18 18:32:09,565 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-18 18:32:09,573 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-18 18:32:09,596 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-18 18:32:09,698 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-18 18:32:09,893 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 28 treesize of output 16 [2022-11-18 18:32:09,973 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-18 18:32:10,037 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 28 treesize of output 16 [2022-11-18 18:32:10,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 18:32:10,171 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 28 treesize of output 16 [2022-11-18 18:32:10,243 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-18 18:32:10,280 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-18 18:32:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:10,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:10,381 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (or (not (<= v_ArrVal_1169 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (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_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |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-18 18:32:10,396 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |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-18 18:32:10,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |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_1169))))) is different from false [2022-11-18 18:32:10,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (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_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |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_1169) (not (<= v_ArrVal_1167 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))) is different from false [2022-11-18 18:32:10,474 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |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_1169) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167)))))) is different from false [2022-11-18 18:32:10,491 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (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_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (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_1169) (< (select (select (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_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |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_1167))))))) is different from false [2022-11-18 18:32:10,565 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (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_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1163 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))))) is different from false [2022-11-18 18:32:10,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (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_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1163)))))))) is different from false [2022-11-18 18:32:10,637 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1162))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (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_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1163) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169)))))))))) is different from false [2022-11-18 18:32:10,897 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1162))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (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_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1163) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169))))))))) (forall ((|ULTIMATE.start_test_fun_~y_ref~0#1.offset| Int)) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse6 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ .cse6 1)))))) is different from false [2022-11-18 18:32:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 37 not checked. [2022-11-18 18:32:10,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163287999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:10,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:32:10,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2022-11-18 18:32:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46837191] [2022-11-18 18:32:10,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:10,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 18:32:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:32:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 18:32:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=668, Unknown=15, NotChecked=650, Total=1560 [2022-11-18 18:32:10,921 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:32:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:12,305 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-11-18 18:32:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:32:12,306 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-18 18:32:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:12,307 INFO L225 Difference]: With dead ends: 70 [2022-11-18 18:32:12,307 INFO L226 Difference]: Without dead ends: 69 [2022-11-18 18:32:12,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=354, Invalid=1076, Unknown=16, NotChecked=810, Total=2256 [2022-11-18 18:32:12,307 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:12,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 72 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 168 Unchecked, 0.0s Time] [2022-11-18 18:32:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-18 18:32:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-18 18:32:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 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-18 18:32:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-11-18 18:32:12,319 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 33 [2022-11-18 18:32:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:12,319 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-11-18 18:32:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:32:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-11-18 18:32:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 18:32:12,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:12,320 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2022-11-18 18:32:12,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-18 18:32:12,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:12,526 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:32:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1011890224, now seen corresponding path program 1 times [2022-11-18 18:32:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:32:12,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432865730] [2022-11-18 18:32:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:32:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:13,027 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-18 18:32:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:32:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432865730] [2022-11-18 18:32:13,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432865730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:32:13,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121464256] [2022-11-18 18:32:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:13,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:13,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:32:13,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:32:13,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 18:32:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:13,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 18:32:13,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:13,340 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:32:13,341 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-18 18:32:13,354 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-18 18:32:13,366 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-18 18:32:13,377 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-18 18:32:13,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:32:13,917 INFO L321 Elim1Store]: treesize reduction 86, result has 44.2 percent of original size [2022-11-18 18:32:13,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 278 treesize of output 291 [2022-11-18 18:32:13,929 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 164 treesize of output 162 [2022-11-18 18:32:13,975 INFO L321 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2022-11-18 18:32:13,975 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 112 treesize of output 47 [2022-11-18 18:32:13,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 5 treesize of output 3 [2022-11-18 18:32:13,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:13,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:13,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 9 [2022-11-18 18:32:13,996 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-18 18:32:14,000 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-18 18:32:14,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:14,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:14,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2022-11-18 18:32:14,137 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 18:32:14,137 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 22 treesize of output 26 [2022-11-18 18:32:14,209 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 28 treesize of output 16 [2022-11-18 18:32:14,261 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-18 18:32:14,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 18:32:14,368 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-18 18:32:14,423 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 28 treesize of output 16 [2022-11-18 18:32:14,477 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-18 18:32:14,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-18 18:32:14,505 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-18 18:32:14,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:14,586 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (or (not (<= v_ArrVal_1259 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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-18 18:32:14,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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-18 18:32:14,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (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_1259) (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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-18 18:32:14,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (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_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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_1259) (not (<= v_ArrVal_1257 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))) is different from false [2022-11-18 18:32:14,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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_1259) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257)))))) is different from false [2022-11-18 18:32:14,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (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_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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_1259) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257))))))) is different from false [2022-11-18 18:32:14,802 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse3 (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_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (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_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ 1 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1259) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1254 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))))) is different from false [2022-11-18 18:32:14,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ 1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1259) (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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-18 18:32:14,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1252))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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_1257) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259))))))))) is different from false [2022-11-18 18:32:14,945 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1252))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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_1257) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259)))))))))) is different from false [2022-11-18 18:32:14,980 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1252))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (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_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |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_1257) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259)))))))))) is different from false [2022-11-18 18:32:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2022-11-18 18:32:15,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121464256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:15,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:32:15,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 37 [2022-11-18 18:32:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859630323] [2022-11-18 18:32:15,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:15,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 18:32:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:32:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 18:32:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=524, Unknown=12, NotChecked=660, Total=1406 [2022-11-18 18:32:15,067 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 states have internal predecessors, (102), 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-18 18:32:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:15,405 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-11-18 18:32:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 18:32:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 states have internal predecessors, (102), 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 35 [2022-11-18 18:32:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:15,406 INFO L225 Difference]: With dead ends: 79 [2022-11-18 18:32:15,406 INFO L226 Difference]: Without dead ends: 78 [2022-11-18 18:32:15,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=719, Unknown=12, NotChecked=770, Total=1806 [2022-11-18 18:32:15,407 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:15,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 83 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 104 Invalid, 0 Unknown, 212 Unchecked, 0.1s Time] [2022-11-18 18:32:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-18 18:32:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2022-11-18 18:32:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.069767441860465) internal successors, (46), 44 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-18 18:32:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-11-18 18:32:15,420 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 35 [2022-11-18 18:32:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:15,420 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-11-18 18:32:15,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 states have internal predecessors, (102), 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-18 18:32:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-11-18 18:32:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 18:32:15,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:15,422 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:15,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-18 18:32:15,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:15,627 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:32:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1829703487, now seen corresponding path program 3 times [2022-11-18 18:32:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:32:15,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552953534] [2022-11-18 18:32:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:32:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:32:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552953534] [2022-11-18 18:32:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552953534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:32:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406629415] [2022-11-18 18:32:16,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:32:16,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:16,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:32:16,569 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:32:16,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 18:32:16,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 18:32:16,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:32:16,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 18:32:16,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:16,897 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:32:16,898 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-18 18:32:16,913 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-18 18:32:16,930 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-18 18:32:16,945 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-18 18:32:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:17,200 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 193 treesize of output 156 [2022-11-18 18:32:17,204 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-18 18:32:17,266 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:32:17,266 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 66 treesize of output 25 [2022-11-18 18:32:17,274 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-18 18:32:17,469 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 18:32:17,470 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 66 treesize of output 25 [2022-11-18 18:32:17,474 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-18 18:32:21,689 INFO L321 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2022-11-18 18:32:21,690 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 192 treesize of output 185 [2022-11-18 18:32:21,768 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-18 18:32:21,777 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-18 18:32:21,795 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 14 treesize of output 11 [2022-11-18 18:32:21,890 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:21,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 36 [2022-11-18 18:32:22,011 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 18:32:22,012 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 21 treesize of output 25 [2022-11-18 18:32:22,118 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 28 treesize of output 16 [2022-11-18 18:32:22,172 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-18 18:32:22,251 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 28 treesize of output 16 [2022-11-18 18:32:22,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 18:32:22,390 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 30 treesize of output 18 [2022-11-18 18:32:22,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 18:32:22,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 18:32:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:22,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:32:24,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1356 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))) is different from false [2022-11-18 18:32:24,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1356 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |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-18 18:32:24,752 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1352 1))) (< (+ v_ArrVal_1356 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ 2147483648 (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-18 18:32:24,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1356 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1352 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ 2147483648 (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-18 18:32:24,823 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (v_ArrVal_1351 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1351))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1352 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1356 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |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-18 18:32:24,871 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (v_ArrVal_1351 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1350)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1351))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1350 1))) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1352 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1356 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-18 18:32:24,915 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (v_ArrVal_1351 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1350)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1351))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1352 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1356 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1350 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))) is different from false [2022-11-18 18:32:24,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (v_ArrVal_1351 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1348))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1350)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1351))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1352 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1350 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1356 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-18 18:32:25,049 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (v_ArrVal_1347 Int) (v_ArrVal_1351 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1347)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1348))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1350)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1351))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1356 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1352 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (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|) v_ArrVal_1347)) (< (+ v_ArrVal_1350 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-18 18:32:25,147 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1350 Int) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1352 Int) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (v_ArrVal_1347 Int) (v_ArrVal_1351 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1347)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1348))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1350)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1351))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1354))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1356 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1352 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (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|) v_ArrVal_1347)) (< (+ v_ArrVal_1350 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-18 18:32:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 58 not checked. [2022-11-18 18:32:25,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406629415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:32:25,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:32:25,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 16] total 46 [2022-11-18 18:32:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077729075] [2022-11-18 18:32:25,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:32:25,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-18 18:32:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:32:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-18 18:32:25,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1019, Unknown=27, NotChecked=790, Total=2162 [2022-11-18 18:32:25,291 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 47 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 47 states have internal predecessors, (113), 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-18 18:32:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:32:26,586 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-11-18 18:32:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 18:32:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 47 states have internal predecessors, (113), 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 39 [2022-11-18 18:32:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:32:26,587 INFO L225 Difference]: With dead ends: 82 [2022-11-18 18:32:26,587 INFO L226 Difference]: Without dead ends: 81 [2022-11-18 18:32:26,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=492, Invalid=1577, Unknown=41, NotChecked=970, Total=3080 [2022-11-18 18:32:26,589 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:32:26,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 66 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 150 Unchecked, 0.1s Time] [2022-11-18 18:32:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-18 18:32:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2022-11-18 18:32:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 states have internal predecessors, (78), 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-18 18:32:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-11-18 18:32:26,601 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 39 [2022-11-18 18:32:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:32:26,601 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-11-18 18:32:26,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.4565217391304346) internal successors, (113), 47 states have internal predecessors, (113), 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-18 18:32:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-11-18 18:32:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 18:32:26,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:32:26,602 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-18 18:32:26,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 18:32:26,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:26,809 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:32:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:32:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1703428993, now seen corresponding path program 5 times [2022-11-18 18:32:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:32:26,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375911645] [2022-11-18 18:32:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:32:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:32:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:32:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:32:27,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375911645] [2022-11-18 18:32:27,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375911645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:32:27,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650984594] [2022-11-18 18:32:27,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 18:32:27,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:32:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:32:27,347 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:32:27,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e65e04-01fc-4100-9522-06e578c3564c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 18:32:27,510 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-18 18:32:27,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:32:27,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-18 18:32:27,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:32:27,678 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-18 18:32:27,678 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-18 18:32:27,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-18 18:32:27,708 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-18 18:32:27,722 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-18 18:32:27,834 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-11-18 18:32:27,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 120 [2022-11-18 18:32:27,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 24 treesize of output 18 [2022-11-18 18:32:27,910 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-18 18:32:27,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:27,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:27,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:27,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:32:27,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 96 treesize of output 87 [2022-11-18 18:32:27,951 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-18 18:32:28,117 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-11-18 18:32:28,117 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 59 treesize of output 28 [2022-11-18 18:32:28,124 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-18 18:32:28,139 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:32:28,312 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 18:32:28,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-18 18:32:28,317 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-18 18:32:28,436 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 32 treesize of output 20 [2022-11-18 18:32:28,588 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:28,588 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 39 treesize of output 42 [2022-11-18 18:32:28,761 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-18 18:32:28,762 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 37 treesize of output 40 [2022-11-18 18:32:28,951 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:28,952 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 40 treesize of output 43 [2022-11-18 18:32:29,138 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:29,138 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 40 treesize of output 43 [2022-11-18 18:32:29,348 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:29,349 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 40 treesize of output 43 [2022-11-18 18:32:29,530 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:29,530 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 40 treesize of output 43 [2022-11-18 18:32:29,727 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-18 18:32:29,727 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 40 treesize of output 43 [2022-11-18 18:32:29,777 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-18 18:32:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:32:29,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:35:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650984594] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:35:37,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:35:37,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 53 [2022-11-18 18:35:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003374539] [2022-11-18 18:35:37,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:35:37,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-18 18:35:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-18 18:35:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=2298, Unknown=67, NotChecked=0, Total=2862 [2022-11-18 18:35:37,790 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 54 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 54 states have internal predecessors, (120), 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-18 18:36:37,722 WARN L233 SmtUtils]: Spent 32.50s on a formula simplification. DAG size of input: 137 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:36:59,239 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 91 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:37:33,013 WARN L233 SmtUtils]: Spent 23.66s on a formula simplification that was a NOOP. DAG size: 209 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)