./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array5_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-patterns/array5_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:06:36,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:06:36,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:06:36,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:06:36,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:06:36,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:06:36,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:06:36,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:06:36,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:06:36,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:06:36,868 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:06:36,868 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:06:36,868 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:06:36,869 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:06:36,869 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:06:36,872 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:06:36,872 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:06:36,872 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:06:36,873 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:06:36,873 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:06:36,873 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:06:36,874 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:06:36,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:06:36,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:06:36,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:06:36,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:06:36,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:06:36,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:06:36,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:06:36,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:06:36,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:06:36,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:06:36,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:06:36,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:06:36,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:06:36,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:06:36,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:06:36,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:06:36,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:06:36,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:06:36,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:06:36,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:06:36,884 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:06:36,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:06:36,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:06:36,885 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:06:36,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:06:36,885 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/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_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 [2024-11-09 06:06:37,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:06:37,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:06:37,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:06:37,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:06:37,174 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:06:37,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/array-patterns/array5_pattern.c Unable to find full path for "g++" [2024-11-09 06:06:39,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:06:39,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:06:39,346 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/sv-benchmarks/c/array-patterns/array5_pattern.c [2024-11-09 06:06:39,356 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/data/8ea657cea/5fde80282d7d492593805216f5354f33/FLAG02967280e [2024-11-09 06:06:39,371 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/data/8ea657cea/5fde80282d7d492593805216f5354f33 [2024-11-09 06:06:39,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:06:39,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:06:39,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:06:39,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:06:39,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:06:39,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416f0bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39, skipping insertion in model container [2024-11-09 06:06:39,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:06:39,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/sv-benchmarks/c/array-patterns/array5_pattern.c[1890,1903] [2024-11-09 06:06:39,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:06:39,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:06:39,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/sv-benchmarks/c/array-patterns/array5_pattern.c[1890,1903] [2024-11-09 06:06:39,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:06:39,678 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:06:39,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39 WrapperNode [2024-11-09 06:06:39,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:06:39,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:06:39,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:06:39,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:06:39,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,710 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-11-09 06:06:39,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:06:39,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:06:39,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:06:39,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:06:39,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:06:39,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:06:39,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:06:39,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:06:39,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (1/1) ... [2024-11-09 06:06:39,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:06:39,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:39,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:06:39,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:06:39,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:06:39,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:06:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:06:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:06:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:06:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:06:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:06:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:06:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:06:39,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:06:39,924 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:06:39,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:06:40,218 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 06:06:40,222 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:06:40,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:06:40,295 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:06:40,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:06:40 BoogieIcfgContainer [2024-11-09 06:06:40,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:06:40,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:06:40,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:06:40,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:06:40,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:06:39" (1/3) ... [2024-11-09 06:06:40,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7af227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:06:40, skipping insertion in model container [2024-11-09 06:06:40,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:06:39" (2/3) ... [2024-11-09 06:06:40,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7af227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:06:40, skipping insertion in model container [2024-11-09 06:06:40,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:06:40" (3/3) ... [2024-11-09 06:06:40,310 INFO L112 eAbstractionObserver]: Analyzing ICFG array5_pattern.c [2024-11-09 06:06:40,335 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:06:40,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:06:40,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:06:40,442 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@53bfbd54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:06:40,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:06:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:06:40,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:40,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:40,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:40,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1700952315, now seen corresponding path program 1 times [2024-11-09 06:06:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:40,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496638871] [2024-11-09 06:06:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:40,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496638871] [2024-11-09 06:06:40,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496638871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:40,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:06:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511096796] [2024-11-09 06:06:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:40,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:06:40,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:06:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:06:40,774 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:06:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:40,832 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-11-09 06:06:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:06:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 06:06:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:40,853 INFO L225 Difference]: With dead ends: 30 [2024-11-09 06:06:40,853 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 06:06:40,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:06:40,863 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:40,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:06:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 06:06:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 06:06:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-09 06:06:40,918 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2024-11-09 06:06:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:40,921 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-09 06:06:40,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:06:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-11-09 06:06:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:06:40,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:40,927 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:40,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:06:40,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash 217389186, now seen corresponding path program 1 times [2024-11-09 06:06:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821839792] [2024-11-09 06:06:40,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:06:41,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821839792] [2024-11-09 06:06:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821839792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:41,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:06:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465022080] [2024-11-09 06:06:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:41,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:06:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:06:41,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:41,355 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:41,401 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-11-09 06:06:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:06:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-09 06:06:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:41,403 INFO L225 Difference]: With dead ends: 25 [2024-11-09 06:06:41,403 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 06:06:41,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:06:41,405 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:41,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:06:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 06:06:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 06:06:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-09 06:06:41,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 18 [2024-11-09 06:06:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:41,414 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 06:06:41,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-09 06:06:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:06:41,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:41,416 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:41,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:06:41,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:41,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1746639609, now seen corresponding path program 1 times [2024-11-09 06:06:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109046715] [2024-11-09 06:06:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:06:41,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109046715] [2024-11-09 06:06:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109046715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:41,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:06:41,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:06:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386743190] [2024-11-09 06:06:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:41,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:06:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:06:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:06:41,701 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:41,804 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 06:06:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:06:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-09 06:06:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:41,806 INFO L225 Difference]: With dead ends: 39 [2024-11-09 06:06:41,806 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 06:06:41,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:06:41,808 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:41,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:06:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 06:06:41,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 06:06:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-09 06:06:41,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 20 [2024-11-09 06:06:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:41,818 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 06:06:41,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:06:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-09 06:06:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:06:41,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:41,819 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:41,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:06:41,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:41,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash -20206238, now seen corresponding path program 1 times [2024-11-09 06:06:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183308360] [2024-11-09 06:06:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:06:41,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795840151] [2024-11-09 06:06:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:41,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:06:41,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:06:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:42,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 06:06:42,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:42,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2024-11-09 06:06:42,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2024-11-09 06:06:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:06:42,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:06:43,120 INFO L349 Elim1Store]: treesize reduction 43, result has 64.8 percent of original size [2024-11-09 06:06:43,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 112 treesize of output 115 [2024-11-09 06:06:43,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:43,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 320 treesize of output 364 [2024-11-09 06:06:44,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 6 [2024-11-09 06:06:44,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2024-11-09 06:06:44,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:44,097 INFO L378 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 30 treesize of output 26 [2024-11-09 06:06:44,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:44,155 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 26 [2024-11-09 06:06:44,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:44,262 INFO L378 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 24 treesize of output 24 [2024-11-09 06:06:44,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:44,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 103 [2024-11-09 06:06:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:47,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183308360] [2024-11-09 06:06:47,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:06:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795840151] [2024-11-09 06:06:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795840151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:06:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2006373792] [2024-11-09 06:06:47,579 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:06:47,580 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:06:47,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:06:47,590 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:06:47,591 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:06:48,511 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:06:48,512 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:06:50,053 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '396#(<= 1 ~ARR_SIZE~0)' at error location [2024-11-09 06:06:50,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:06:50,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:06:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2024-11-09 06:06:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770057812] [2024-11-09 06:06:50,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:06:50,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 06:06:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 06:06:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 06:06:50,058 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:06:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:50,873 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2024-11-09 06:06:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 06:06:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-11-09 06:06:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:50,875 INFO L225 Difference]: With dead ends: 65 [2024-11-09 06:06:50,875 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 06:06:50,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=310, Invalid=2042, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 06:06:50,877 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 78 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:50,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:06:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 06:06:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2024-11-09 06:06:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:06:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-11-09 06:06:50,887 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 22 [2024-11-09 06:06:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:50,887 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-09 06:06:50,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:06:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-09 06:06:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:06:50,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:50,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:50,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:06:51,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:51,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:06:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1224887037, now seen corresponding path program 2 times [2024-11-09 06:06:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046241032] [2024-11-09 06:06:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:06:51,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:51,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046241032] [2024-11-09 06:06:51,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046241032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:06:51,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089308829] [2024-11-09 06:06:51,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:06:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:51,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:06:51,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:06:51,390 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 06:06:51,390 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:06:51,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 06:06:51,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:51,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2024-11-09 06:06:51,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2024-11-09 06:06:51,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:51,747 INFO L378 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 34 treesize of output 17 [2024-11-09 06:06:51,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 5 [2024-11-09 06:06:51,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2024-11-09 06:06:52,432 INFO L349 Elim1Store]: treesize reduction 112, result has 39.5 percent of original size [2024-11-09 06:06:52,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 177 [2024-11-09 06:06:52,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2024-11-09 06:06:52,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-09 06:06:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:06:52,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:06:53,159 INFO L349 Elim1Store]: treesize reduction 43, result has 64.8 percent of original size [2024-11-09 06:06:53,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 112 treesize of output 115 [2024-11-09 06:06:53,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:53,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 335 treesize of output 371 [2024-11-09 06:06:53,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2024-11-09 06:06:53,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:53,887 INFO L378 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 30 treesize of output 26 [2024-11-09 06:06:54,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:54,048 INFO L378 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 24 treesize of output 24 [2024-11-09 06:06:54,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:54,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 105 [2024-11-09 06:06:55,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:55,440 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 26 [2024-11-09 06:06:55,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 6 [2024-11-09 06:06:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:06:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089308829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:06:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [324957053] [2024-11-09 06:06:57,031 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:06:57,032 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:06:57,032 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:06:57,032 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:06:57,033 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:06:57,637 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:06:57,638 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:06:58,960 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '745#(<= 1 ~ARR_SIZE~0)' at error location [2024-11-09 06:06:58,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:06:58,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:06:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 24 [2024-11-09 06:06:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287698356] [2024-11-09 06:06:58,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:06:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 06:06:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 06:06:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1208, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 06:06:58,964 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 24 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:07:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:00,331 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2024-11-09 06:07:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 06:07:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2024-11-09 06:07:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:00,334 INFO L225 Difference]: With dead ends: 86 [2024-11-09 06:07:00,334 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 06:07:00,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=592, Invalid=3190, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 06:07:00,340 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:00,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 145 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 367 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:07:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 06:07:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2024-11-09 06:07:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:07:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-09 06:07:00,367 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2024-11-09 06:07:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-09 06:07:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:07:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-09 06:07:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:07:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:00,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:00,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:07:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:00,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash 91153602, now seen corresponding path program 3 times [2024-11-09 06:07:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062157405] [2024-11-09 06:07:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:07:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213140506] [2024-11-09 06:07:00,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:07:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:00,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:00,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:07:00,725 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:07:00,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:00,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 06:07:00,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:00,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2024-11-09 06:07:00,794 INFO L378 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 27 treesize of output 15 [2024-11-09 06:07:00,859 INFO L378 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 42 treesize of output 35 [2024-11-09 06:07:01,843 INFO L349 Elim1Store]: treesize reduction 616, result has 19.1 percent of original size [2024-11-09 06:07:01,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 32 case distinctions, treesize of input 137 treesize of output 242 [2024-11-09 06:07:01,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:02,031 INFO L349 Elim1Store]: treesize reduction 27, result has 51.8 percent of original size [2024-11-09 06:07:02,032 INFO L378 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 3 case distinctions, treesize of input 92 treesize of output 93 [2024-11-09 06:07:02,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:02,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:07:02,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-09 06:07:02,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:02,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:07:02,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-09 06:07:07,312 INFO L349 Elim1Store]: treesize reduction 556, result has 33.9 percent of original size [2024-11-09 06:07:07,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 658 treesize of output 854 [2024-11-09 06:07:07,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 194 [2024-11-09 06:07:07,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 190 [2024-11-09 06:07:07,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 186 [2024-11-09 06:07:07,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 182 [2024-11-09 06:07:07,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 178 [2024-11-09 06:07:07,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2024-11-09 06:07:07,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 170 [2024-11-09 06:07:07,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 166 [2024-11-09 06:07:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:08,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:14,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062157405] [2024-11-09 06:07:14,002 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:07:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213140506] [2024-11-09 06:07:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213140506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [883491725] [2024-11-09 06:07:14,005 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:07:14,006 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:07:14,006 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:07:14,006 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:07:14,007 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:07:14,647 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:07:14,648 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:17,117 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1124#(<= 1 ~ARR_SIZE~0)' at error location [2024-11-09 06:07:17,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:17,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:07:17,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-09 06:07:17,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119317680] [2024-11-09 06:07:17,118 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:17,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 06:07:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:17,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 06:07:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1142, Unknown=8, NotChecked=0, Total=1332 [2024-11-09 06:07:17,121 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:07:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:19,550 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-09 06:07:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:07:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-09 06:07:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:19,552 INFO L225 Difference]: With dead ends: 62 [2024-11-09 06:07:19,552 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 06:07:19,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=194, Invalid=1204, Unknown=8, NotChecked=0, Total=1406 [2024-11-09 06:07:19,554 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:19,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 144 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 6 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:07:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 06:07:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2024-11-09 06:07:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:07:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-09 06:07:19,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 26 [2024-11-09 06:07:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-09 06:07:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:07:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-09 06:07:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:07:19,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:19,570 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:19,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:07:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:19,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -241746723, now seen corresponding path program 4 times [2024-11-09 06:07:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122908461] [2024-11-09 06:07:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:07:20,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122908461] [2024-11-09 06:07:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122908461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833141269] [2024-11-09 06:07:20,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 06:07:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:20,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:20,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:07:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:20,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:07:20,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:20,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:07:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833141269] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:07:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1789345134] [2024-11-09 06:07:20,329 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:07:20,329 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:07:20,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:07:20,330 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:07:20,330 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:07:20,762 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:07:20,763 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:22,039 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1483#(<= 1 ~ARR_SIZE~0)' at error location [2024-11-09 06:07:22,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:22,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:07:22,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-09 06:07:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302509264] [2024-11-09 06:07:22,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:22,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:07:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:07:22,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2024-11-09 06:07:22,042 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:07:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:22,489 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-11-09 06:07:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:07:22,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 06:07:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:22,490 INFO L225 Difference]: With dead ends: 89 [2024-11-09 06:07:22,490 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 06:07:22,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 06:07:22,492 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:22,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 103 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:07:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 06:07:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 56. [2024-11-09 06:07:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:07:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-11-09 06:07:22,522 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 28 [2024-11-09 06:07:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:22,522 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-09 06:07:22,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:07:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-11-09 06:07:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 06:07:22,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:22,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:22,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:07:22,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:22,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1495015751, now seen corresponding path program 5 times [2024-11-09 06:07:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157640519] [2024-11-09 06:07:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:22,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:07:22,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157640519] [2024-11-09 06:07:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157640519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728172957] [2024-11-09 06:07:22,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:07:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:22,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:22,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:07:23,072 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 06:07:23,072 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:23,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:07:23,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:07:23,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:07:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728172957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:07:23,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817757647] [2024-11-09 06:07:23,330 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:07:23,330 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:07:23,331 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:07:23,331 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:07:23,331 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:07:23,765 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:07:23,767 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:24,911 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1903#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= 1 ~ARR_SIZE~0))' at error location [2024-11-09 06:07:24,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:24,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:07:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-09 06:07:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622656285] [2024-11-09 06:07:24,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:07:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:07:24,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-11-09 06:07:24,914 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:07:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:25,169 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2024-11-09 06:07:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:07:25,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 06:07:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:25,171 INFO L225 Difference]: With dead ends: 102 [2024-11-09 06:07:25,171 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 06:07:25,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2024-11-09 06:07:25,173 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:25,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 68 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:07:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 06:07:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2024-11-09 06:07:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:07:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-09 06:07:25,204 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 28 [2024-11-09 06:07:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-09 06:07:25,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:07:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-09 06:07:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:07:25,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:25,206 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:25,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:07:25,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:25,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:25,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1808523461, now seen corresponding path program 1 times [2024-11-09 06:07:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704486477] [2024-11-09 06:07:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:07:25,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704486477] [2024-11-09 06:07:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704486477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279630316] [2024-11-09 06:07:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:25,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:25,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:25,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:07:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:07:25,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:07:25,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:07:25,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:07:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279630316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:07:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1317415984] [2024-11-09 06:07:25,844 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:07:25,844 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:07:25,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:07:25,845 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:07:25,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:07:26,711 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:07:26,713 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:27,601 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2350#(<= 1 ~ARR_SIZE~0)' at error location [2024-11-09 06:07:27,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:27,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:07:27,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 06:07:27,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575502757] [2024-11-09 06:07:27,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:27,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:07:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:07:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=556, Unknown=1, NotChecked=0, Total=650 [2024-11-09 06:07:27,603 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:07:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:27,757 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-11-09 06:07:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:07:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-09 06:07:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:27,758 INFO L225 Difference]: With dead ends: 74 [2024-11-09 06:07:27,759 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 06:07:27,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=599, Unknown=1, NotChecked=0, Total=702 [2024-11-09 06:07:27,760 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:27,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:07:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 06:07:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-09 06:07:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 06:07:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-09 06:07:27,787 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2024-11-09 06:07:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:27,787 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-09 06:07:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:07:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-09 06:07:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:07:27,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:27,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:27,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:07:27,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:27,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:27,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash -594616670, now seen corresponding path program 6 times [2024-11-09 06:07:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:27,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130610300] [2024-11-09 06:07:27,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:07:28,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839498559] [2024-11-09 06:07:28,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:07:28,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:28,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:28,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:07:28,169 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:07:28,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:28,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 06:07:28,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:28,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2024-11-09 06:07:28,251 INFO L378 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 27 treesize of output 15 [2024-11-09 06:07:28,332 INFO L378 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 42 treesize of output 35 [2024-11-09 06:07:28,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-09 06:07:30,070 INFO L349 Elim1Store]: treesize reduction 924, result has 19.0 percent of original size [2024-11-09 06:07:30,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 60 case distinctions, treesize of input 165 treesize of output 326 [2024-11-09 06:07:30,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:30,216 INFO L349 Elim1Store]: treesize reduction 27, result has 51.8 percent of original size [2024-11-09 06:07:30,216 INFO L378 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 3 case distinctions, treesize of input 142 treesize of output 135 [2024-11-09 06:07:30,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:30,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:30,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2024-11-09 06:07:30,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:30,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:30,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2024-11-09 06:07:32,375 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse4 (select .cse9 8)) (.cse0 (select .cse8 0)) (.cse3 (select .cse9 0)) (.cse7 (select .cse8 8))) (let ((.cse1 (= .cse7 0)) (.cse5 (= 0 .cse3)) (.cse6 (= .cse0 0)) (.cse2 (= .cse4 0))) (or (and (or (and (= .cse0 1) .cse1 .cse2 (= 0 (+ .cse3 1))) (and (= (+ .cse4 1) 0) .cse5 .cse6 (= .cse7 1))) (= (select .cse8 4) 0) (= (select .cse9 4) 0)) (and .cse1 .cse5 .cse6 .cse2 (let ((.cse10 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse22 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse22 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse22 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0)))))) (or .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse11 0) 0) (= (select .cse11 4) 0) (= (select .cse11 8) 0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (select .cse14 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse12 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse13 0) 0) (= (select .cse12 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse12 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse13 4) 0) (= (select .cse13 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))))))) (and .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse15 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse15 0) 0) (= (select .cse15 4) 0) (= (select .cse15 8) 0))))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (select .cse18 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse16 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse17 0) 0) (= (select .cse16 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse16 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse17 4) 0) (= (select .cse17 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (select .cse21 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse19 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse20 0) 0) (= (select .cse19 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse19 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse20 4) 0) (= (select .cse20 8) 0))))))))) (exists ((|v_ULTIMATE.start_main_~index~0#1_48| Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~index~0#1_48|))) (and (<= 0 |v_ULTIMATE.start_main_~index~0#1_48|) (<= |v_ULTIMATE.start_main_~index~0#1_48| 2) (= (select .cse9 .cse23) 1) (= (+ (select .cse8 .cse23) 1) 0))))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from true [2024-11-09 06:07:33,340 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 0) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse4 (select .cse9 8)) (.cse0 (select .cse8 0)) (.cse3 (select .cse9 0)) (.cse7 (select .cse8 8))) (let ((.cse1 (= .cse7 0)) (.cse5 (= 0 .cse3)) (.cse6 (= .cse0 0)) (.cse2 (= .cse4 0))) (or (and (or (and (= .cse0 1) .cse1 .cse2 (= 0 (+ .cse3 1))) (and (= (+ .cse4 1) 0) .cse5 .cse6 (= .cse7 1))) (= (select .cse8 4) 0) (= (select .cse9 4) 0)) (and .cse1 .cse5 .cse6 .cse2 (let ((.cse10 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse22 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse22 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse22 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0)))))) (or .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse11 0) 0) (= (select .cse11 4) 0) (= (select .cse11 8) 0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (select .cse14 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse12 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse13 0) 0) (= (select .cse12 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse12 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse13 4) 0) (= (select .cse13 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))))))) (and .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse15 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse15 0) 0) (= (select .cse15 4) 0) (= (select .cse15 8) 0))))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (select .cse18 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse16 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse17 0) 0) (= (select .cse16 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse16 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse17 4) 0) (= (select .cse17 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (select .cse21 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse19 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse20 0) 0) (= (select .cse19 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse19 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse20 4) 0) (= (select .cse20 8) 0))))))))) (exists ((|v_ULTIMATE.start_main_~index~0#1_48| Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~index~0#1_48|))) (and (<= 0 |v_ULTIMATE.start_main_~index~0#1_48|) (<= |v_ULTIMATE.start_main_~index~0#1_48| 2) (= (select .cse9 .cse23) 1) (= (+ (select .cse8 .cse23) 1) 0))))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from true [2024-11-09 06:07:34,491 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse3 (select .cse9 0))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~count~0#1| 1) (let ((.cse4 (select .cse9 8)) (.cse7 (select .cse8 8))) (let ((.cse1 (= .cse7 0)) (.cse5 (= 0 .cse3)) (.cse6 (= .cse0 0)) (.cse2 (= .cse4 0))) (or (and (or (and (= .cse0 1) .cse1 .cse2 (= 0 (+ .cse3 1))) (and (= (+ .cse4 1) 0) .cse5 .cse6 (= .cse7 1))) (= (select .cse8 4) 0) (= (select .cse9 4) 0)) (and .cse1 .cse5 .cse6 .cse2 (let ((.cse10 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse22 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse22 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse22 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0)))))) (or .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse11 0) 0) (= (select .cse11 4) 0) (= (select .cse11 8) 0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (select .cse14 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse12 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse13 0) 0) (= (select .cse12 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse12 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse13 4) 0) (= (select .cse13 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))))))) (and .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse15 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse15 0) 0) (= (select .cse15 4) 0) (= (select .cse15 8) 0))))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (select .cse18 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse16 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse17 0) 0) (= (select .cse16 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse16 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse17 4) 0) (= (select .cse17 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (select .cse21 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse19 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse20 0) 0) (= (select .cse19 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse19 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse20 4) 0) (= (select .cse20 8) 0))))))))) (exists ((|v_ULTIMATE.start_main_~index~0#1_48| Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~index~0#1_48|))) (and (<= 0 |v_ULTIMATE.start_main_~index~0#1_48|) (<= |v_ULTIMATE.start_main_~index~0#1_48| 2) (= (select .cse9 .cse23) 1) (= (+ (select .cse8 .cse23) 1) 0)))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= |c_ULTIMATE.start_main_~sum~0#1| (+ .cse0 .cse3))))) is different from true [2024-11-09 06:07:35,687 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse25 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse25 4)) (.cse1 (select .cse23 4)) (.cse2 (select .cse25 0)) (.cse3 (select .cse23 0))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= |c_ULTIMATE.start_main_~sum~0#1| (+ .cse0 .cse1 .cse2 .cse3)) (let ((.cse6 (select .cse23 8)) (.cse9 (select .cse25 8))) (let ((.cse4 (= .cse9 0)) (.cse7 (= 0 .cse3)) (.cse8 (= .cse2 0)) (.cse5 (= .cse6 0))) (or (and (or (and (= .cse2 1) .cse4 .cse5 (= 0 (+ .cse3 1))) (and (= (+ .cse6 1) 0) .cse7 .cse8 (= .cse9 1))) (= .cse0 0) (= .cse1 0)) (and .cse4 .cse7 .cse8 .cse5 (let ((.cse10 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse22 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse22 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse22 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0)))))) (or .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse11 0) 0) (= (select .cse11 4) 0) (= (select .cse11 8) 0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse13 (select .cse14 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse12 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse13 0) 0) (= (select .cse12 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse12 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse13 4) 0) (= (select .cse13 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))))))) (and .cse10 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25| Int)) (let ((.cse15 (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse15 0) 0) (= (select .cse15 4) 0) (= (select .cse15 8) 0))))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse17 (select .cse18 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse16 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse17 0) 0) (= (select .cse16 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse16 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse17 4) 0) (= (select .cse17 8) 0))))) (not (= |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25| Int)) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_10))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (select .cse21 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_25|))) (and (= (select .cse19 0) 0) (= (select v_DerPreprocessor_10 8) 0) (= (select .cse20 0) 0) (= (select .cse19 4) 1) (= (select v_DerPreprocessor_10 0) 0) (= (select .cse19 8) 0) (= (+ (select v_DerPreprocessor_10 4) 1) 0) (= (select .cse20 4) 0) (= (select .cse20 8) 0))))))))) (exists ((|v_ULTIMATE.start_main_~index~0#1_48| Int)) (let ((.cse24 (* 4 |v_ULTIMATE.start_main_~index~0#1_48|))) (and (<= 0 |v_ULTIMATE.start_main_~index~0#1_48|) (<= |v_ULTIMATE.start_main_~index~0#1_48| 2) (= (select .cse23 .cse24) 1) (= (+ (select .cse25 .cse24) 1) 0)))))))) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= |c_ULTIMATE.start_main_~count~0#1| 2)))) is different from true [2024-11-09 06:07:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:38,391 INFO L349 Elim1Store]: treesize reduction 360, result has 59.5 percent of original size [2024-11-09 06:07:38,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 4 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 231 case distinctions, treesize of input 856 treesize of output 1232 [2024-11-09 06:07:38,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 305 treesize of output 299 [2024-11-09 06:07:38,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 299 treesize of output 293 [2024-11-09 06:07:38,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 293 treesize of output 287 [2024-11-09 06:07:38,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 287 treesize of output 281 [2024-11-09 06:07:38,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 281 treesize of output 275 [2024-11-09 06:07:38,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 275 treesize of output 269 [2024-11-09 06:07:38,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 269 treesize of output 263 [2024-11-09 06:07:38,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 263 treesize of output 257 [2024-11-09 06:07:38,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 257 treesize of output 251 [2024-11-09 06:07:38,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 251 treesize of output 245 [2024-11-09 06:07:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-09 06:07:41,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:07:43,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:07:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130610300] [2024-11-09 06:07:43,903 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:07:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839498559] [2024-11-09 06:07:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839498559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:07:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [779078421] [2024-11-09 06:07:43,906 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:07:43,906 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:07:43,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:07:43,907 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:07:43,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:07:44,328 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 06:07:44,329 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:07:46,123 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2706#(<= 1 ~ARR_SIZE~0)' at error location [2024-11-09 06:07:46,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:07:46,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:07:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-09 06:07:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254235280] [2024-11-09 06:07:46,123 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 06:07:46,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:07:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:07:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:07:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=982, Unknown=4, NotChecked=268, Total=1406 [2024-11-09 06:07:46,125 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:07:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:07:46,508 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-11-09 06:07:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:07:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-09 06:07:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:07:46,510 INFO L225 Difference]: With dead ends: 80 [2024-11-09 06:07:46,510 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 06:07:46,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=166, Invalid=1036, Unknown=4, NotChecked=276, Total=1482 [2024-11-09 06:07:46,511 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:07:46,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 72 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 328 Unchecked, 0.2s Time] [2024-11-09 06:07:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 06:07:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2024-11-09 06:07:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:07:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 06:07:46,547 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 30 [2024-11-09 06:07:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:07:46,547 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 06:07:46,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:07:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 06:07:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:07:46,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:07:46,549 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:07:46,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 06:07:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 06:07:46,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:07:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:07:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -578505888, now seen corresponding path program 2 times [2024-11-09 06:07:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:07:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929135871] [2024-11-09 06:07:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:07:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:07:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:07:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519199504] [2024-11-09 06:07:46,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:07:46,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:07:46,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:07:46,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:07:46,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce4b97fe-05a5-4345-816d-bc3f991b2031/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:07:47,134 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 06:07:47,134 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:07:47,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 06:07:47,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:07:47,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2024-11-09 06:07:47,202 INFO L378 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 27 treesize of output 15 [2024-11-09 06:07:47,290 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-09 06:07:47,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2024-11-09 06:07:48,396 INFO L349 Elim1Store]: treesize reduction 848, result has 17.3 percent of original size [2024-11-09 06:07:48,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 153 treesize of output 274 [2024-11-09 06:07:52,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,168 INFO L349 Elim1Store]: treesize reduction 54, result has 51.4 percent of original size [2024-11-09 06:07:52,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 153 [2024-11-09 06:07:52,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:52,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 06:07:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:52,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2024-11-09 06:07:52,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:07:52,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-09 06:07:52,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:07:52,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:07:52,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2024-11-09 06:07:58,705 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ (- 4) (* c_~ARR_SIZE~0 4))) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse67 (select .cse9 0)) (.cse2 (select .cse9 .cse14)) (.cse66 (select .cse11 0))) (let ((.cse35 (= .cse66 1)) (.cse6 (= .cse2 0)) (.cse36 (= 0 (+ .cse67 1))) (.cse4 (<= 1 c_~ARR_SIZE~0)) (.cse29 (exists ((v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse69 (select .cse70 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse69 .cse14) 0) (= (+ (select .cse69 0) 1) 0) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) .cse14) 0) (= (select v_DerPreprocessor_12 0) 1) (= (select (select .cse70 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0)))))) (.cse34 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse68 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse68 .cse14) 0) (= (+ (select .cse68 0) 1) 0) (= (select v_DerPreprocessor_12 0) 1))))) (.cse5 (select .cse11 .cse14)) (.cse3 (mod (+ c_~ARR_SIZE~0 1) 2)) (.cse0 (= 0 .cse67)) (.cse1 (= .cse66 0)) (.cse42 (= c_~ARR_SIZE~0 1))) (let ((.cse20 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_y_22 Int)) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse64 (* v_y_22 8))) (and (= (select .cse11 .cse64) 1) (= (+ (select .cse65 .cse64) 1) 0) (= (+ (select .cse9 .cse64) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse65 .cse14) 0) (<= (+ (* v_y_22 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_22) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse65 0) 0) (= (select v_DerPreprocessor_12 .cse64) 1))))) (.cse37 (= (+ .cse2 1) 0)) (.cse38 (or .cse1 .cse42)) (.cse39 (or .cse0 .cse42)) (.cse40 (= .cse3 0)) (.cse41 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (and (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) 0) (= (select v_DerPreprocessor_12 0) 1)))) (.cse47 (= .cse5 1)) (.cse7 (= .cse5 0)) (.cse16 (exists ((v_y_24 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse62 (* v_y_24 8)) (.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse62) 1) 0) (= (select v_DerPreprocessor_12 .cse62) 1) (= (+ (select .cse63 .cse62) 1) 0) (= (select .cse11 .cse62) 1) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse63 .cse14) 0) (<= (+ (* v_y_24 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse63 0) 0) (<= 0 v_y_24))))) (.cse48 (and .cse1 (exists ((v_y_14 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse61 (* v_y_14 8))) (and (<= 0 v_y_14) (= (+ (select .cse60 .cse61) 1) 0) (= (select v_DerPreprocessor_12 .cse61) 1) (<= (+ (* v_y_14 2) 1) c_~ARR_SIZE~0) (= (+ (select .cse9 .cse61) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse60 .cse14) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse60 0) 0) (= (select .cse11 .cse61) 1)))))) (.cse21 (and .cse1 (exists ((v_y_17 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse59 (* v_y_17 8))) (and (= (+ (select .cse58 .cse59) 1) 0) (= (+ (select .cse9 .cse59) 1) 0) (= (select .cse11 .cse59) 1) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse58 .cse14) 0) (<= (+ (* v_y_17 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse58 0) 0) (= 1 (select v_DerPreprocessor_12 .cse59)) (<= 0 v_y_17)))))) (.cse53 (and .cse35 .cse6 .cse36 .cse4 (or .cse29 .cse34)))) (or (and .cse0 .cse1 (or (and (= .cse2 1) (<= 1 .cse3) .cse4 (= (+ .cse5 1) 0)) (and .cse6 .cse7 (exists ((v_z_7 Int) (v_y_7 Int)) (let ((.cse10 (+ (* v_y_7 8) (* v_z_7 4))) (.cse8 (* 2 v_y_7))) (and (<= 0 (+ v_z_7 .cse8)) (= (select .cse9 .cse10) 1) (not (= v_z_7 0)) (<= v_z_7 1) (= (+ (select .cse11 .cse10) 1) 0) (<= 0 v_z_7) (<= (+ v_z_7 .cse8 1) c_~ARR_SIZE~0))))))) (and (or (and .cse6 .cse0 (or (and (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_y_24 Int)) (let ((.cse12 (* v_y_24 8))) (and (= (+ (select .cse9 .cse12) 1) 0) (= (select .cse11 .cse12) 1) (<= (+ (* v_y_24 2) 1) c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse12) 1) (= (+ (select .cse13 .cse12) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse13 .cse14) 0) (= (select (select .cse15 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse13 0) 0))))) (<= 0 v_y_24)))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0))) .cse16) .cse1) (and .cse1 (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_y_22 Int)) (let ((.cse17 (* v_y_22 8))) (and (= (select .cse11 .cse17) 1) (= (+ (select .cse9 .cse17) 1) 0) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse18 .cse17) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse18 .cse14) 0) (= (select (select .cse19 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse18 0) 0) (= (select v_DerPreprocessor_12 .cse17) 1))))) (<= (+ (* v_y_22 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_22)))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array2~0#1.base|)))) .cse20)) .cse21 (and .cse1 (exists ((v_y_14 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (* v_y_14 8))) (and (<= 0 v_y_14) (= (+ (select .cse22 .cse23) 1) 0) (= (select v_DerPreprocessor_12 .cse23) 1) (<= (+ (* v_y_14 2) 1) c_~ARR_SIZE~0) (= (+ (select .cse9 .cse23) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse22 .cse14) 0) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (= (select (select .cse24 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse22 0) 0) (= (select .cse11 .cse23) 1)))))) (and .cse1 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_y_20 Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse26 (* v_y_20 8))) (and (= (+ (select .cse25 .cse26) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse25 .cse14) 0) (= (select v_DerPreprocessor_12 .cse26) 1) (<= 0 v_y_20) (<= (+ (* v_y_20 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse11 .cse26) 1) (= (select .cse25 0) 0) (= (+ (select .cse9 .cse26) 1) 0))))))) (and (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|)) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse27 .cse14) 0) (= (+ (select .cse27 0) 1) 0) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) .cse14) 0) (= (select (select .cse28 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 1) (= (select (select .cse28 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0))))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0))) .cse29 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse30 .cse14) 0) (= (+ (select .cse30 0) 1) 0) (= (select (select .cse31 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0))))) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select v_DerPreprocessor_12 0) 1))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse32 .cse14) 0) (= (+ (select .cse32 0) 1) 0) (= (select (select .cse33 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0))))) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select v_DerPreprocessor_12 0) 1))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array2~0#1.base|)))) .cse34) .cse35 .cse6 .cse36 .cse4)) .cse7) (and .cse37 .cse38 .cse4 .cse39 .cse40 (or (and (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (= (select v_DerPreprocessor_12 0) 1) (exists ((v_DerPreprocessor_11 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) 0)))))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0))) .cse41))) .cse42) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 1) (= (select (select .cse43 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse44 0) 0) (= (+ (select .cse44 .cse14) 1) 0))))))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select (select .cse45 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select .cse46 0) 0) (= (+ (select .cse46 .cse14) 1) 0))))) (= (select v_DerPreprocessor_12 .cse14) 1) (= (select v_DerPreprocessor_12 0) 0))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0)))) .cse47) (and (or (and .cse6 .cse0 (or .cse48 (and (or .cse20 (exists ((v_y_22 Int)) (let ((.cse49 (* v_y_22 8))) (and (= (select .cse11 .cse49) 1) (= (+ (select .cse9 .cse49) 1) 0) (<= (+ (* v_y_22 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_22) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse50 .cse49) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse50 .cse14) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse50 0) 0) (= (select v_DerPreprocessor_12 .cse49) 1)))))))) .cse1) (and .cse1 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_y_20 Int)) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse52 (* v_y_20 8))) (and (= (+ (select .cse51 .cse52) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse51 .cse14) 0) (= (select v_DerPreprocessor_12 .cse52) 1) (<= 0 v_y_20) (<= (+ (* v_y_20 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse11 .cse52) 1) (= (select .cse51 0) 0) (= (+ (select .cse9 .cse52) 1) 0))))))) .cse53) .cse7) (and .cse37 .cse38 .cse4 .cse39 .cse40 (or (and (or (and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0)) .cse41) .cse41) .cse42) (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (= (select v_DerPreprocessor_12 .cse14) 1) (= (select v_DerPreprocessor_12 0) 0) (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse54 0) 0) (= (+ (select .cse54 .cse14) 1) 0)))))) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 1) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse55 0) 0) (= (+ (select .cse55 .cse14) 1) 0))))) .cse47) (and .cse7 (or (and .cse6 .cse0 (or (and .cse1 (or (exists ((v_y_24 Int)) (let ((.cse56 (* v_y_24 8))) (and (= (+ (select .cse9 .cse56) 1) 0) (= (select .cse11 .cse56) 1) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse56) 1) (= (+ (select .cse57 .cse56) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse57 .cse14) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse57 0) 0)))) (<= (+ (* v_y_24 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_24)))) .cse16)) .cse48 .cse21)) .cse53))))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= |c_ULTIMATE.start_main_~count~0#1| 2) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from true [2024-11-09 06:08:01,588 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse14 (+ (- 4) (* c_~ARR_SIZE~0 4))) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse67 (select .cse9 0)) (.cse2 (select .cse9 .cse14)) (.cse66 (select .cse11 0))) (let ((.cse35 (= .cse66 1)) (.cse6 (= .cse2 0)) (.cse36 (= 0 (+ .cse67 1))) (.cse4 (<= 1 c_~ARR_SIZE~0)) (.cse29 (exists ((v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse69 (select .cse70 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse69 .cse14) 0) (= (+ (select .cse69 0) 1) 0) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) .cse14) 0) (= (select v_DerPreprocessor_12 0) 1) (= (select (select .cse70 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0)))))) (.cse34 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse68 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse68 .cse14) 0) (= (+ (select .cse68 0) 1) 0) (= (select v_DerPreprocessor_12 0) 1))))) (.cse5 (select .cse11 .cse14)) (.cse3 (mod (+ c_~ARR_SIZE~0 1) 2)) (.cse0 (= 0 .cse67)) (.cse1 (= .cse66 0)) (.cse48 (= c_~ARR_SIZE~0 1))) (let ((.cse20 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_y_22 Int)) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse64 (* v_y_22 8))) (and (= (select .cse11 .cse64) 1) (= (+ (select .cse65 .cse64) 1) 0) (= (+ (select .cse9 .cse64) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse65 .cse14) 0) (<= (+ (* v_y_22 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_22) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse65 0) 0) (= (select v_DerPreprocessor_12 .cse64) 1))))) (.cse43 (= (+ .cse2 1) 0)) (.cse44 (or .cse1 .cse48)) (.cse45 (or .cse0 .cse48)) (.cse46 (= .cse3 0)) (.cse47 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (and (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) 0) (= (select v_DerPreprocessor_12 0) 1)))) (.cse51 (= .cse5 1)) (.cse7 (= .cse5 0)) (.cse16 (exists ((v_y_24 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse62 (* v_y_24 8)) (.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse9 .cse62) 1) 0) (= (select v_DerPreprocessor_12 .cse62) 1) (= (+ (select .cse63 .cse62) 1) 0) (= (select .cse11 .cse62) 1) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse63 .cse14) 0) (<= (+ (* v_y_24 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse63 0) 0) (<= 0 v_y_24))))) (.cse37 (and .cse1 (exists ((v_y_14 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse61 (* v_y_14 8))) (and (<= 0 v_y_14) (= (+ (select .cse60 .cse61) 1) 0) (= (select v_DerPreprocessor_12 .cse61) 1) (<= (+ (* v_y_14 2) 1) c_~ARR_SIZE~0) (= (+ (select .cse9 .cse61) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse60 .cse14) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse60 0) 0) (= (select .cse11 .cse61) 1)))))) (.cse21 (and .cse1 (exists ((v_y_17 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse59 (* v_y_17 8))) (and (= (+ (select .cse58 .cse59) 1) 0) (= (+ (select .cse9 .cse59) 1) 0) (= (select .cse11 .cse59) 1) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse58 .cse14) 0) (<= (+ (* v_y_17 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse58 0) 0) (= 1 (select v_DerPreprocessor_12 .cse59)) (<= 0 v_y_17)))))) (.cse42 (and .cse35 .cse6 .cse36 .cse4 (or .cse29 .cse34)))) (or (and .cse0 .cse1 (or (and (= .cse2 1) (<= 1 .cse3) .cse4 (= (+ .cse5 1) 0)) (and .cse6 .cse7 (exists ((v_z_7 Int) (v_y_7 Int)) (let ((.cse10 (+ (* v_y_7 8) (* v_z_7 4))) (.cse8 (* 2 v_y_7))) (and (<= 0 (+ v_z_7 .cse8)) (= (select .cse9 .cse10) 1) (not (= v_z_7 0)) (<= v_z_7 1) (= (+ (select .cse11 .cse10) 1) 0) (<= 0 v_z_7) (<= (+ v_z_7 .cse8 1) c_~ARR_SIZE~0))))))) (and (or (and .cse6 .cse0 (or (and (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_y_24 Int)) (let ((.cse12 (* v_y_24 8))) (and (= (+ (select .cse9 .cse12) 1) 0) (= (select .cse11 .cse12) 1) (<= (+ (* v_y_24 2) 1) c_~ARR_SIZE~0) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse12) 1) (= (+ (select .cse13 .cse12) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse13 .cse14) 0) (= (select (select .cse15 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse13 0) 0))))) (<= 0 v_y_24)))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0))) .cse16) .cse1) (and .cse1 (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_y_22 Int)) (let ((.cse17 (* v_y_22 8))) (and (= (select .cse11 .cse17) 1) (= (+ (select .cse9 .cse17) 1) 0) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse18 .cse17) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse18 .cse14) 0) (= (select (select .cse19 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse18 0) 0) (= (select v_DerPreprocessor_12 .cse17) 1))))) (<= (+ (* v_y_22 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_22)))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array2~0#1.base|)))) .cse20)) .cse21 (and .cse1 (exists ((v_y_14 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (* v_y_14 8))) (and (<= 0 v_y_14) (= (+ (select .cse22 .cse23) 1) 0) (= (select v_DerPreprocessor_12 .cse23) 1) (<= (+ (* v_y_14 2) 1) c_~ARR_SIZE~0) (= (+ (select .cse9 .cse23) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse22 .cse14) 0) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (= (select (select .cse24 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse22 0) 0) (= (select .cse11 .cse23) 1)))))) (and .cse1 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_y_20 Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse26 (* v_y_20 8))) (and (= (+ (select .cse25 .cse26) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse25 .cse14) 0) (= (select v_DerPreprocessor_12 .cse26) 1) (<= 0 v_y_20) (<= (+ (* v_y_20 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse11 .cse26) 1) (= (select .cse25 0) 0) (= (+ (select .cse9 .cse26) 1) 0))))))) (and (or (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|)) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse27 .cse14) 0) (= (+ (select .cse27 0) 1) 0) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) .cse14) 0) (= (select (select .cse28 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 1) (= (select (select .cse28 |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0))))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0))) .cse29 (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse30 .cse14) 0) (= (+ (select .cse30 0) 1) 0) (= (select (select .cse31 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0))))) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select v_DerPreprocessor_12 0) 1))) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse32 .cse14) 0) (= (+ (select .cse32 0) 1) 0) (= (select (select .cse33 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0))))) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select v_DerPreprocessor_12 0) 1))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |c_ULTIMATE.start_main_~#array2~0#1.base|)))) .cse34) .cse35 .cse6 .cse36 .cse4)) .cse7) (and (or (and .cse6 .cse0 (or .cse37 (and (or .cse20 (exists ((v_y_22 Int)) (let ((.cse38 (* v_y_22 8))) (and (= (select .cse11 .cse38) 1) (= (+ (select .cse9 .cse38) 1) 0) (<= (+ (* v_y_22 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_22) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (+ (select .cse39 .cse38) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse39 .cse14) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse39 0) 0) (= (select v_DerPreprocessor_12 .cse38) 1)))))))) .cse1) (and .cse1 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_y_20 Int)) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse41 (* v_y_20 8))) (and (= (+ (select .cse40 .cse41) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse40 .cse14) 0) (= (select v_DerPreprocessor_12 .cse41) 1) (<= 0 v_y_20) (<= (+ (* v_y_20 2) 1) c_~ARR_SIZE~0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse11 .cse41) 1) (= (select .cse40 0) 0) (= (+ (select .cse9 .cse41) 1) 0))))))) .cse42) .cse7) (and .cse43 .cse44 .cse4 .cse45 .cse46 (or (and (or (and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0)) .cse47) .cse47) .cse48) (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (= (select v_DerPreprocessor_12 .cse14) 1) (= (select v_DerPreprocessor_12 0) 0) (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select .cse49 0) 0) (= (+ (select .cse49 .cse14) 1) 0)))))) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 1) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse50 0) 0) (= (+ (select .cse50 .cse14) 1) 0))))) .cse51) (and .cse43 .cse44 .cse4 .cse45 .cse46 (or (and (or (and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_29|) 0) 0))) .cse47) (and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0)) .cse47)) .cse48) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse14) 1) (= (select (select .cse52 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse53 0) 0) (= (+ (select .cse53 .cse14) 1) 0))))))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29| Int)) (and (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_11 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select (select .cse54 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) 0) 0) (= (select .cse55 0) 0) (= (+ (select .cse55 .cse14) 1) 0))))) (= (select v_DerPreprocessor_12 .cse14) 1) (= (select v_DerPreprocessor_12 0) 0))) (= (select (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_29|) .cse14) 0)))) .cse51) (and .cse7 (or (and .cse6 .cse0 (or (and .cse1 (or (exists ((v_y_24 Int)) (let ((.cse56 (* v_y_24 8))) (and (= (+ (select .cse9 .cse56) 1) 0) (= (select .cse11 .cse56) 1) (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse57 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= (select v_DerPreprocessor_12 .cse56) 1) (= (+ (select .cse57 .cse56) 1) 0) (= (select v_DerPreprocessor_12 .cse14) 0) (= (select .cse57 .cse14) 0) (= (select v_DerPreprocessor_12 0) 0) (= (select .cse57 0) 0)))) (<= (+ (* v_y_24 2) 1) c_~ARR_SIZE~0) (<= 0 v_y_24)))) .cse16)) .cse37 .cse21)) .cse42))))))) (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (= |c_ULTIMATE.start_main_~count~0#1| 2) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from true