./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ifeqn1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/ifeqn1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh --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 6c377c3922cafbc07c158cb252290a97b70e1cbfc6e9de773d7729c460f56857 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:34:28,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:34:28,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:34:28,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:34:28,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:34:28,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:34:28,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:34:28,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:34:28,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:34:28,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:34:28,623 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:34:28,624 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:34:28,624 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:34:28,624 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:34:28,625 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:34:28,625 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:34:28,626 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:34:28,626 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:34:28,627 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:34:28,627 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:34:28,628 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:34:28,629 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:34:28,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:34:28,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:34:28,630 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:34:28,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:34:28,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:34:28,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:34:28,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:34:28,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:34:28,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:34:28,633 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:34:28,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:34:28,634 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:34:28,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:34:28,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:34:28,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:34:28,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:34:28,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:34:28,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:34:28,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:34:28,635 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:34:28,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:34:28,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:34:28,636 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:34:28,636 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:34:28,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:34:28,636 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_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/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_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh 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 -> 6c377c3922cafbc07c158cb252290a97b70e1cbfc6e9de773d7729c460f56857 [2023-12-02 19:34:28,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:34:28,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:34:28,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:34:28,853 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:34:28,853 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:34:28,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/array-fpi/ifeqn1.c [2023-12-02 19:34:31,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:34:31,750 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:34:31,750 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/sv-benchmarks/c/array-fpi/ifeqn1.c [2023-12-02 19:34:31,758 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/data/ebf5b77cb/0e8de9aa6cb441fc973258df9c9de5de/FLAG2f2f096bd [2023-12-02 19:34:31,770 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/data/ebf5b77cb/0e8de9aa6cb441fc973258df9c9de5de [2023-12-02 19:34:31,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:34:31,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:34:31,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:34:31,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:34:31,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:34:31,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:31,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714e4cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31, skipping insertion in model container [2023-12-02 19:34:31,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:31,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:34:31,915 WARN L240 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_e0a10d51-fa55-4201-844a-5266870ee86b/sv-benchmarks/c/array-fpi/ifeqn1.c[589,602] [2023-12-02 19:34:31,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:34:31,941 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:34:31,951 WARN L240 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_e0a10d51-fa55-4201-844a-5266870ee86b/sv-benchmarks/c/array-fpi/ifeqn1.c[589,602] [2023-12-02 19:34:31,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:34:31,973 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:34:31,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31 WrapperNode [2023-12-02 19:34:31,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:34:31,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:34:31,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:34:31,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:34:31,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:31,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,007 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2023-12-02 19:34:32,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:34:32,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:34:32,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:34:32,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:34:32,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:34:32,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:34:32,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:34:32,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:34:32,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (1/1) ... [2023-12-02 19:34:32,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:34:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:32,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:34:32,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:34:32,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:34:32,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:34:32,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:34:32,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:34:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:34:32,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:34:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:34:32,164 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:34:32,166 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:34:32,305 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:34:32,381 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:34:32,381 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 19:34:32,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:34:32 BoogieIcfgContainer [2023-12-02 19:34:32,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:34:32,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:34:32,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:34:32,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:34:32,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:34:31" (1/3) ... [2023-12-02 19:34:32,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edd929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:34:32, skipping insertion in model container [2023-12-02 19:34:32,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:34:31" (2/3) ... [2023-12-02 19:34:32,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edd929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:34:32, skipping insertion in model container [2023-12-02 19:34:32,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:34:32" (3/3) ... [2023-12-02 19:34:32,392 INFO L112 eAbstractionObserver]: Analyzing ICFG ifeqn1.c [2023-12-02 19:34:32,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:34:32,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:34:32,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:34:32,451 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@128e0d88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:34:32,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:34:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 19:34:32,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:32,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:32,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:32,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1983426717, now seen corresponding path program 1 times [2023-12-02 19:34:32,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:32,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286949208] [2023-12-02 19:34:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:32,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286949208] [2023-12-02 19:34:32,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-02 19:34:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242579549] [2023-12-02 19:34:32,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:32,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:32,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:34:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:32,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:34:32,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:32,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:34:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242579549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:34:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:34:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:34:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433322049] [2023-12-02 19:34:32,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:34:32,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:34:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:34:32,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:34:32,799 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:32,854 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2023-12-02 19:34:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:34:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 19:34:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:32,863 INFO L225 Difference]: With dead ends: 20 [2023-12-02 19:34:32,863 INFO L226 Difference]: Without dead ends: 10 [2023-12-02 19:34:32,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:34:32,870 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:32,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:34:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-12-02 19:34:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-12-02 19:34:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-02 19:34:32,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2023-12-02 19:34:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:32,902 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-02 19:34:32,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-02 19:34:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:34:32,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:32,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:32,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:34:33,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:33,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:33,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1487113961, now seen corresponding path program 1 times [2023-12-02 19:34:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619298296] [2023-12-02 19:34:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:33,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:33,135 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152251152] [2023-12-02 19:34:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:33,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:33,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:34:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:33,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:34:33,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:33,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:34:33,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619298296] [2023-12-02 19:34:33,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152251152] [2023-12-02 19:34:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152251152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:34:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:34:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:34:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890468372] [2023-12-02 19:34:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:34:33,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:34:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:33,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:34:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:34:33,244 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:33,296 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-12-02 19:34:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:34:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 19:34:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:33,297 INFO L225 Difference]: With dead ends: 21 [2023-12-02 19:34:33,298 INFO L226 Difference]: Without dead ends: 16 [2023-12-02 19:34:33,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:34:33,300 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:33,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:34:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-02 19:34:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2023-12-02 19:34:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-02 19:34:33,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-12-02 19:34:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:33,305 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-02 19:34:33,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-02 19:34:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:34:33,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:33,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:33,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:34:33,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:33,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:33,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1154978300, now seen corresponding path program 1 times [2023-12-02 19:34:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974506612] [2023-12-02 19:34:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:33,540 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764634461] [2023-12-02 19:34:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:33,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:33,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:33,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:33,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:34:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:33,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 19:34:33,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:33,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:34:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:33,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:33,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:33,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 51 [2023-12-02 19:34:33,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:33,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 19:34:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:33,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974506612] [2023-12-02 19:34:33,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764634461] [2023-12-02 19:34:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764634461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:33,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2065901112] [2023-12-02 19:34:33,917 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 19:34:33,917 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:33,921 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:33,926 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:33,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:34,698 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:34,856 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '200#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_main_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem13#1| 1)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:34:34,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:34,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-02 19:34:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116094355] [2023-12-02 19:34:34,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:34,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:34:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:34,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:34:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-02 19:34:34,859 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:35,039 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-02 19:34:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:34:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 19:34:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:35,041 INFO L225 Difference]: With dead ends: 27 [2023-12-02 19:34:35,041 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 19:34:35,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:34:35,042 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:35,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:34:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 19:34:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2023-12-02 19:34:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-02 19:34:35,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2023-12-02 19:34:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:35,048 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-02 19:34:35,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-02 19:34:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:34:35,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:35,049 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:35,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:34:35,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:35,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:35,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1455459767, now seen corresponding path program 2 times [2023-12-02 19:34:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464407884] [2023-12-02 19:34:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:35,288 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:35,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879212374] [2023-12-02 19:34:35,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:34:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:35,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:35,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:35,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:34:35,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 19:34:35,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:34:35,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:34:35,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:35,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:35,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464407884] [2023-12-02 19:34:35,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879212374] [2023-12-02 19:34:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879212374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [675736058] [2023-12-02 19:34:35,457 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 19:34:35,457 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:35,458 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:35,458 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:35,458 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:35,934 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:36,083 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '330#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_main_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem13#1| 1)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:34:36,083 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:36,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-02 19:34:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021117184] [2023-12-02 19:34:36,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:36,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:34:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:34:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:34:36,085 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:36,203 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-12-02 19:34:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:34:36,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 19:34:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:36,204 INFO L225 Difference]: With dead ends: 35 [2023-12-02 19:34:36,205 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 19:34:36,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-02 19:34:36,206 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:36,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:34:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 19:34:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2023-12-02 19:34:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-02 19:34:36,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2023-12-02 19:34:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:36,211 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-02 19:34:36,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-02 19:34:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:34:36,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:36,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:36,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:34:36,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:36,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:36,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -463626365, now seen corresponding path program 3 times [2023-12-02 19:34:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769667355] [2023-12-02 19:34:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:36,447 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313947756] [2023-12-02 19:34:36,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:34:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:36,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:36,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:34:36,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:34:36,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:34:36,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 19:34:36,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:36,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:34:36,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 19:34:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:36,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:36,843 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 5 treesize of output 3 [2023-12-02 19:34:36,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:36,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 51 [2023-12-02 19:34:36,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:36,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 19:34:36,989 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 53 treesize of output 49 [2023-12-02 19:34:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:34:36,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:36,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769667355] [2023-12-02 19:34:36,999 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:36,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313947756] [2023-12-02 19:34:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313947756] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [115200568] [2023-12-02 19:34:37,002 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 19:34:37,002 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:37,003 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:37,003 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:37,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:37,413 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:37,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '480#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_main_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem13#1| 1)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:34:37,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:37,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-02 19:34:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620443766] [2023-12-02 19:34:37,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:37,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:34:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:34:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:34:37,557 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:37,816 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-12-02 19:34:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:34:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 19:34:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:37,817 INFO L225 Difference]: With dead ends: 40 [2023-12-02 19:34:37,817 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 19:34:37,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-02 19:34:37,818 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:37,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 26 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:34:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 19:34:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 17. [2023-12-02 19:34:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-02 19:34:37,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2023-12-02 19:34:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:37,824 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-02 19:34:37,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-02 19:34:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:34:37,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:37,825 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:37,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:34:38,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:38,031 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:38,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1479528739, now seen corresponding path program 4 times [2023-12-02 19:34:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81478933] [2023-12-02 19:34:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:38,066 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:38,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683772551] [2023-12-02 19:34:38,066 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:34:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:38,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:38,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:34:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:38,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 19:34:38,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:38,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:38,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81478933] [2023-12-02 19:34:38,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683772551] [2023-12-02 19:34:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683772551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1769462989] [2023-12-02 19:34:38,271 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 19:34:38,271 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:38,271 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:38,271 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:38,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:38,639 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:38,789 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '659#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_main_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem13#1| 1)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:34:38,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:38,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:38,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-02 19:34:38,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688751284] [2023-12-02 19:34:38,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:38,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 19:34:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 19:34:38,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-02 19:34:38,792 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:38,946 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-12-02 19:34:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:34:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 19:34:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:38,947 INFO L225 Difference]: With dead ends: 54 [2023-12-02 19:34:38,947 INFO L226 Difference]: Without dead ends: 43 [2023-12-02 19:34:38,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-12-02 19:34:38,949 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:38,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 30 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:34:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-02 19:34:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2023-12-02 19:34:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-12-02 19:34:38,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 13 [2023-12-02 19:34:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:38,958 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-12-02 19:34:38,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-12-02 19:34:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 19:34:38,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:38,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:38,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:34:39,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:39,159 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:39,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 726967951, now seen corresponding path program 1 times [2023-12-02 19:34:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174100431] [2023-12-02 19:34:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:39,184 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:39,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106953861] [2023-12-02 19:34:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:39,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:39,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:34:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:34:39,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 19:34:39,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:39,389 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 [2023-12-02 19:34:39,403 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 11 treesize of output 7 [2023-12-02 19:34:39,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 19:34:39,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:39,464 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 1 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 19:34:39,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:39,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2023-12-02 19:34:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:39,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:40,221 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 [2023-12-02 19:34:45,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:45,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 47 [2023-12-02 19:34:45,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:45,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 19:34:46,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 54 [2023-12-02 19:34:46,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:34:46,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 53 [2023-12-02 19:34:46,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2023-12-02 19:34:46,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:34:46,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 55 [2023-12-02 19:34:46,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 476 treesize of output 470 [2023-12-02 19:34:46,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,242 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 274 [2023-12-02 19:34:46,252 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 262 treesize of output 258 [2023-12-02 19:34:46,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:34:46,264 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 259 treesize of output 235 [2023-12-02 19:34:46,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:34:46,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,302 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 236 treesize of output 237 [2023-12-02 19:34:46,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:46,336 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 215 treesize of output 203 [2023-12-02 19:34:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:46,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:46,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174100431] [2023-12-02 19:34:46,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:46,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106953861] [2023-12-02 19:34:46,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106953861] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:46,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316610508] [2023-12-02 19:34:46,574 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 19:34:46,575 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:46,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:46,575 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:46,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:46,923 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:47,287 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '888#(and (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|))' at error location [2023-12-02 19:34:47,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:47,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-02 19:34:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018109067] [2023-12-02 19:34:47,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:47,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 19:34:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 19:34:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=566, Unknown=7, NotChecked=0, Total=650 [2023-12-02 19:34:47,289 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:51,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:34:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:54,655 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2023-12-02 19:34:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 19:34:54,656 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-02 19:34:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:54,656 INFO L225 Difference]: With dead ends: 94 [2023-12-02 19:34:54,656 INFO L226 Difference]: Without dead ends: 84 [2023-12-02 19:34:54,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=350, Invalid=1897, Unknown=9, NotChecked=0, Total=2256 [2023-12-02 19:34:54,658 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 188 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:54,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 79 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 195 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 19:34:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-02 19:34:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 34. [2023-12-02 19:34:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-02 19:34:54,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 14 [2023-12-02 19:34:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:54,668 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-02 19:34:54,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-02 19:34:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 19:34:54,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:54,669 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:54,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:34:54,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:54,870 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:54,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash 294247383, now seen corresponding path program 5 times [2023-12-02 19:34:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:54,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293487584] [2023-12-02 19:34:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:54,899 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501802880] [2023-12-02 19:34:54,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:34:54,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:54,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:54,900 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:54,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 19:34:55,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:34:55,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:34:55,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 19:34:55,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:55,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:34:55,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293487584] [2023-12-02 19:34:55,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501802880] [2023-12-02 19:34:55,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501802880] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:55,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1143350966] [2023-12-02 19:34:55,213 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 19:34:55,213 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:55,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:55,213 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:55,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:55,434 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:55,578 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_main_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem13#1| 1)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:34:55,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:55,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-12-02 19:34:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631701943] [2023-12-02 19:34:55,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:55,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:34:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:34:55,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-12-02 19:34:55,581 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:34:55,816 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-12-02 19:34:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:34:55,817 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-02 19:34:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:34:55,818 INFO L225 Difference]: With dead ends: 79 [2023-12-02 19:34:55,818 INFO L226 Difference]: Without dead ends: 65 [2023-12-02 19:34:55,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2023-12-02 19:34:55,819 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:34:55,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 47 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:34:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-02 19:34:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2023-12-02 19:34:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-02 19:34:55,835 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 14 [2023-12-02 19:34:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:34:55,836 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-02 19:34:55,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:34:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-02 19:34:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 19:34:55,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:34:55,837 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:34:55,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 19:34:56,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:56,038 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:34:56,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:34:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2089736285, now seen corresponding path program 6 times [2023-12-02 19:34:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:34:56,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469817834] [2023-12-02 19:34:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:34:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:34:56,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:34:56,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602246752] [2023-12-02 19:34:56,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:34:56,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:34:56,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:34:56,063 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:34:56,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:34:56,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:34:56,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:34:56,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 19:34:56,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:34:56,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:34:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:34:56,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:34:56,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:34:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:34:56,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:34:56,959 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 5 treesize of output 3 [2023-12-02 19:34:57,141 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 5 treesize of output 3 [2023-12-02 19:34:57,798 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 5 treesize of output 3 [2023-12-02 19:34:58,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:58,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 51 [2023-12-02 19:34:58,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:34:58,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 19:34:58,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 340 [2023-12-02 19:34:58,538 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 26 treesize of output 24 [2023-12-02 19:34:58,548 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 26 treesize of output 24 [2023-12-02 19:34:58,556 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 5 treesize of output 3 [2023-12-02 19:34:58,564 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 154 treesize of output 150 [2023-12-02 19:34:58,582 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 68 treesize of output 66 [2023-12-02 19:34:58,606 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 152 treesize of output 150 [2023-12-02 19:34:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 19:34:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 19:34:58,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:34:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469817834] [2023-12-02 19:34:58,667 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:34:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602246752] [2023-12-02 19:34:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602246752] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:34:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911893019] [2023-12-02 19:34:58,668 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-12-02 19:34:58,668 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:34:58,669 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:34:58,669 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:34:58,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:34:58,906 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:34:59,143 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1503#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_187| Int)) (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 |v_ULTIMATE.start_main_~i~0#1_187|) (= |ULTIMATE.start_main_~b~0#1.offset| 0))) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_main_#t~mem13#1| (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem13#1| 1)) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:34:59,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:34:59,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:34:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-02 19:34:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70001468] [2023-12-02 19:34:59,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:34:59,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 19:34:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:34:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 19:34:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2023-12-02 19:34:59,145 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:00,489 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2023-12-02 19:35:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 19:35:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 19:35:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:00,491 INFO L225 Difference]: With dead ends: 98 [2023-12-02 19:35:00,491 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 19:35:00,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 19:35:00,493 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:00,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 117 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:35:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 19:35:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 40. [2023-12-02 19:35:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-02 19:35:00,513 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 15 [2023-12-02 19:35:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:00,513 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-02 19:35:00,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-02 19:35:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 19:35:00,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:00,514 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:00,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 19:35:00,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:35:00,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:35:00,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1748901903, now seen corresponding path program 2 times [2023-12-02 19:35:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962526507] [2023-12-02 19:35:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:00,739 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:35:00,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598703440] [2023-12-02 19:35:00,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:35:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:35:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:35:00,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:35:00,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 19:35:00,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:35:00,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:35:00,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 19:35:00,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:35:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:35:01,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:35:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:35:01,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962526507] [2023-12-02 19:35:01,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:35:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598703440] [2023-12-02 19:35:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598703440] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:35:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [522404053] [2023-12-02 19:35:01,076 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 19:35:01,076 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:35:01,076 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:35:01,076 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:35:01,077 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:35:01,357 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:35:01,527 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1844#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|))' at error location [2023-12-02 19:35:01,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:35:01,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:35:01,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-12-02 19:35:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21329401] [2023-12-02 19:35:01,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:35:01,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:35:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:35:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-12-02 19:35:01,529 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:01,814 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-12-02 19:35:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:35:01,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 19:35:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:01,815 INFO L225 Difference]: With dead ends: 65 [2023-12-02 19:35:01,815 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 19:35:01,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2023-12-02 19:35:01,816 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 93 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:01,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 62 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:35:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 19:35:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2023-12-02 19:35:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-12-02 19:35:01,830 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 16 [2023-12-02 19:35:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:01,830 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-12-02 19:35:01,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-12-02 19:35:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:35:01,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:01,831 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:01,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 19:35:02,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:35:02,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:35:02,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 222472815, now seen corresponding path program 3 times [2023-12-02 19:35:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:02,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787157644] [2023-12-02 19:35:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:02,056 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:35:02,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576640629] [2023-12-02 19:35:02,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:35:02,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:35:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:35:02,057 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:35:02,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 19:35:02,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:35:02,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:35:02,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-02 19:35:02,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:35:02,683 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 [2023-12-02 19:35:02,701 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 11 treesize of output 7 [2023-12-02 19:35:02,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:35:02,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:35:02,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 19:35:02,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 19:35:02,853 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:35:02,854 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-02 19:35:02,886 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:35:02,886 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 37 treesize of output 31 [2023-12-02 19:35:02,914 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 19:35:02,914 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 37 treesize of output 31 [2023-12-02 19:35:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:03,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:35:03,297 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 [2023-12-02 19:35:06,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse21 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse24 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse35 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse32 (mod .cse24 4294967296)) (.cse34 (mod .cse21 4294967296)) (.cse33 (mod .cse22 4294967296))) (let ((.cse28 (* .cse33 8)) (.cse29 (* 8 .cse34)) (.cse31 (* .cse32 8)) (.cse30 (* .cse35 8)) (.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (+ .cse30 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse25 (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse27 (< .cse35 2147483648)) (.cse0 (< 2147483647 .cse35)) (.cse8 (< 2147483647 .cse32)) (.cse13 (< .cse33 2147483648)) (.cse14 (< 2147483647 .cse34)) (.cse15 (< .cse34 2147483648)) (.cse16 (+ .cse31 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (+ .cse29 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (+ .cse28 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse12 (< 2147483647 .cse33)) (.cse7 (< .cse32 2147483648)) (.cse2 (+ .cse31 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse19 (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (+ .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (+ .cse29 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (+ (- 34359738368) .cse28 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (or .cse0 (let ((.cse3 (+ (select .cse1 .cse17) (select .cse18 .cse19)))) (and (or (forall ((v_DerPreprocessor_49 Int) (v_DerPreprocessor_38 Int)) (= (select (store (store (store .cse1 .cse2 .cse3) .cse4 v_DerPreprocessor_49) .cse5 v_DerPreprocessor_38) .cse6) 3)) .cse7) (or .cse8 (let ((.cse9 (store .cse1 .cse16 .cse3))) (and (or (forall ((v_DerPreprocessor_45 Int) (v_DerPreprocessor_39 Int)) (= (select (store (store .cse9 .cse10 v_DerPreprocessor_45) .cse11 v_DerPreprocessor_39) .cse6) 3)) .cse12) (or .cse13 (and (or (forall ((v_DerPreprocessor_38 Int) (v_DerPreprocessor_50 Int)) (= (select (store (store .cse9 .cse10 v_DerPreprocessor_50) .cse5 v_DerPreprocessor_38) .cse6) 3)) .cse14) (or .cse15 (forall ((v_DerPreprocessor_49 Int) (v_DerPreprocessor_38 Int)) (= (select (store (store .cse9 .cse4 v_DerPreprocessor_49) .cse5 v_DerPreprocessor_38) .cse6) 3))))))))))) (or (let ((.cse23 (+ (select .cse18 .cse25) (select .cse1 .cse26)))) (and (or (let ((.cse20 (store .cse1 .cse2 .cse23))) (and (or .cse12 (and (or .cse15 (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_39 Int)) (= 3 (select (store (store .cse20 .cse4 v_DerPreprocessor_46) .cse11 v_DerPreprocessor_39) .cse6)))) (or (forall ((v_DerPreprocessor_45 Int) (v_DerPreprocessor_39 Int)) (= (select (store (store .cse20 .cse10 v_DerPreprocessor_45) .cse11 v_DerPreprocessor_39) .cse6) 3)) .cse14) (not (= .cse21 0)))) (not (= .cse22 0)) (or .cse13 (forall ((v_DerPreprocessor_49 Int) (v_DerPreprocessor_38 Int)) (= (select (store (store .cse20 .cse4 v_DerPreprocessor_49) .cse5 v_DerPreprocessor_38) .cse6) 3))))) .cse7) (or (and (forall ((v_DerPreprocessor_45 Int) (v_DerPreprocessor_39 Int)) (= (select (store (store (store .cse1 .cse16 .cse23) .cse10 v_DerPreprocessor_45) .cse11 v_DerPreprocessor_39) .cse6) 3)) (not (= .cse24 0))) .cse8))) .cse27) (or (and (or (and (or (and (or (and (or .cse15 (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_prenex_86 Int)) (= 3 (select (store (store (store v_DerPreprocessor_52 .cse2 (+ (select v_DerPreprocessor_52 .cse26) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) .cse4 v_DerPreprocessor_46) .cse11 v_prenex_86) .cse6)))) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_88 Int) (v_prenex_87 Int)) (= 3 (select (store (store (store v_DerPreprocessor_52 .cse2 (+ (select v_DerPreprocessor_52 .cse26) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) .cse10 v_prenex_87) .cse11 v_prenex_88) .cse6))) .cse14)) .cse12) (or .cse13 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_49 Int) (v_DerPreprocessor_38 Int)) (= 3 (select (store (store (store v_DerPreprocessor_52 .cse2 (+ (select v_DerPreprocessor_52 .cse26) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) .cse4 v_DerPreprocessor_49) .cse5 v_DerPreprocessor_38) .cse6))))) .cse7) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_45 Int) (v_DerPreprocessor_39 Int)) (= (select (store (store (store v_DerPreprocessor_52 .cse16 (+ (select v_DerPreprocessor_52 .cse26) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) .cse10 v_DerPreprocessor_45) .cse11 v_DerPreprocessor_39) .cse6) 3)) .cse8)) .cse27) (or .cse0 (and (or .cse8 (and (or .cse13 (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_89 Int) (v_DerPreprocessor_50 Int)) (= (select (store (store (store v_DerPreprocessor_52 .cse16 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) (select v_DerPreprocessor_52 .cse17))) .cse10 v_DerPreprocessor_50) .cse5 v_prenex_89) .cse6) 3)) .cse14) (or .cse15 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_95 Int) (v_prenex_94 Int)) (= (select (store (store (store v_DerPreprocessor_52 .cse16 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) (select v_DerPreprocessor_52 .cse17))) .cse4 v_prenex_94) .cse5 v_prenex_95) .cse6) 3))))) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_92 Int) (v_prenex_93 Int)) (= (select (store (store (store v_DerPreprocessor_52 .cse16 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) (select v_DerPreprocessor_52 .cse17))) .cse10 v_prenex_92) .cse11 v_prenex_93) .cse6) 3)) .cse12))) (or .cse7 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_90 Int) (v_prenex_91 Int)) (= (select (store (store (store v_DerPreprocessor_52 .cse2 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) (select v_DerPreprocessor_52 .cse17))) .cse4 v_prenex_90) .cse5 v_prenex_91) .cse6) 3)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0))))))) is different from false [2023-12-02 19:35:08,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 19:35:10,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse16 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse9 (mod .cse16 4294967296)) (.cse17 (* .cse18 8))) (let ((.cse1 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse4 (< .cse18 2147483648)) (.cse5 (< 2147483647 .cse18)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (* .cse9 8))) (and (or (let ((.cse2 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_DerPreprocessor_56 (Array Int Int))) (or (not (= (store (store .cse0 .cse1 (select v_DerPreprocessor_56 .cse1)) .cse2 (select v_DerPreprocessor_56 .cse2)) v_DerPreprocessor_56)) (= 2 (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_56))) (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse4) (or .cse5 (forall ((v_DerPreprocessor_56 (Array Int Int))) (or (not (= (store (store .cse0 .cse6 (select v_DerPreprocessor_56 .cse6)) .cse2 (select v_DerPreprocessor_56 .cse2)) v_DerPreprocessor_56)) (= 2 (select (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_56))) (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (< .cse9 2147483648)) (or (< 2147483647 .cse9) (let ((.cse10 (= .cse16 0))) (and (or .cse10 (let ((.cse12 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (forall ((v_DerPreprocessor_54 (Array Int Int))) (= 2 (select (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (or (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (not (= (store (store .cse0 .cse1 (select v_DerPreprocessor_54 .cse1)) .cse12 (select v_DerPreprocessor_54 .cse12)) v_DerPreprocessor_54)) (= 2 (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse4) (or .cse5 (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (not (= v_DerPreprocessor_54 (store (store .cse0 .cse6 (select v_DerPreprocessor_54 .cse6)) .cse12 (select v_DerPreprocessor_54 .cse12)))) (= 2 (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse14 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or (not .cse10) (forall ((v_DerPreprocessor_55 (Array Int Int))) (= 2 (select (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_55))) (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) is different from false [2023-12-02 19:35:10,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2023-12-02 19:35:14,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse25 (mod .cse2 4294967296)) (.cse28 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse19 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse20 (mod .cse19 4294967296)) (.cse27 (* .cse28 8)) (.cse26 (* .cse25 8))) (let ((.cse10 (< 2147483647 .cse25)) (.cse13 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse16 (< .cse28 2147483648)) (.cse11 (< 2147483647 .cse28)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse9 (< .cse25 2147483648)) (.cse17 (* 8 .cse20))) (and (or (let ((.cse1 (= .cse19 0))) (and (or (forall ((v_DerPreprocessor_55 (Array Int Int))) (= 2 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_55))) (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not .cse1)) (or .cse1 (let ((.cse3 (forall ((v_DerPreprocessor_54 (Array Int Int))) (= 2 (select (select (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse18 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (.cse7 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (not (= .cse2 0)) .cse3) (or (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (not (= v_DerPreprocessor_54 (store (store (store .cse4 .cse5 (select v_DerPreprocessor_54 .cse5)) .cse6 (select v_DerPreprocessor_54 .cse6)) .cse7 (select v_DerPreprocessor_54 .cse7)))) (= 2 (select (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse9) (or .cse10 (and (or .cse11 (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (not (= v_DerPreprocessor_54 (store (store (store .cse4 .cse12 (select v_DerPreprocessor_54 .cse12)) .cse13 (select v_DerPreprocessor_54 .cse13)) .cse7 (select v_DerPreprocessor_54 .cse7)))) (= 2 (select (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse14 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (or .cse3 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (or (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (not (= v_DerPreprocessor_54 (store (store (store .cse4 .cse5 (select v_DerPreprocessor_54 .cse5)) .cse13 (select v_DerPreprocessor_54 .cse13)) .cse7 (select v_DerPreprocessor_54 .cse7)))) (= 2 (select (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54))) (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse16)))))))) (< 2147483647 .cse20)) (or (< .cse20 2147483648) (let ((.cse21 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or .cse10 (forall ((v_DerPreprocessor_56 (Array Int Int))) (or (not (= v_DerPreprocessor_56 (store (store (store .cse4 .cse12 (select v_DerPreprocessor_56 .cse12)) .cse13 (select v_DerPreprocessor_56 .cse13)) .cse21 (select v_DerPreprocessor_56 .cse21)))) (= 2 (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_56))) (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (or (and (or (forall ((v_prenex_103 (Array Int Int))) (or (not (= (store (store (store .cse4 .cse5 (select v_prenex_103 .cse5)) .cse6 (select v_prenex_103 .cse6)) .cse21 (select v_prenex_103 .cse21)) v_prenex_103)) (= (select (select (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_103))) (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) .cse16) (or .cse11 (forall ((v_prenex_103 (Array Int Int))) (or (not (= (store (store (store .cse4 .cse12 (select v_prenex_103 .cse12)) .cse6 (select v_prenex_103 .cse6)) .cse21 (select v_prenex_103 .cse21)) v_prenex_103)) (= (select (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_103))) (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) .cse9))))))))) is different from false [2023-12-02 19:35:14,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:35:14,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 47 [2023-12-02 19:35:14,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:35:14,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 19:35:14,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:14,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 1 [2023-12-02 19:35:14,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:14,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:14,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:14,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 1 [2023-12-02 19:35:14,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:15,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 1 [2023-12-02 19:35:15,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:15,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:15,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:15,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 1 [2023-12-02 19:35:15,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 1 [2023-12-02 19:35:15,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:35:15,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 1 [2023-12-02 19:35:15,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:35:15,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 735 treesize of output 719 [2023-12-02 19:35:15,213 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 375 treesize of output 371 [2023-12-02 19:35:15,225 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 372 treesize of output 368 [2023-12-02 19:35:15,236 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 369 treesize of output 365 [2023-12-02 19:35:15,247 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 366 treesize of output 362 [2023-12-02 19:35:15,258 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 363 treesize of output 359 [2023-12-02 19:35:15,267 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 360 treesize of output 356 [2023-12-02 19:35:15,276 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 357 treesize of output 353 [2023-12-02 19:35:15,284 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 354 treesize of output 350 [2023-12-02 19:35:15,293 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 351 treesize of output 347 [2023-12-02 19:35:15,425 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 26 treesize of output 22 [2023-12-02 19:35:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-12-02 19:35:15,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787157644] [2023-12-02 19:35:15,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:35:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576640629] [2023-12-02 19:35:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576640629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:35:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [326098337] [2023-12-02 19:35:15,458 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 19:35:15,458 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:35:15,458 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:35:15,459 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:35:15,459 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:35:15,688 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:35:16,151 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2155#(and (<= 1 ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|))' at error location [2023-12-02 19:35:16,151 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:35:16,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:35:16,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-12-02 19:35:16,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163173359] [2023-12-02 19:35:16,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:35:16,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 19:35:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:16,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 19:35:16,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=846, Unknown=20, NotChecked=186, Total=1190 [2023-12-02 19:35:16,153 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:35:27,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:36:05,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:36:07,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:36:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:36:18,473 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2023-12-02 19:36:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 19:36:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 19:36:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:36:18,475 INFO L225 Difference]: With dead ends: 150 [2023-12-02 19:36:18,475 INFO L226 Difference]: Without dead ends: 148 [2023-12-02 19:36:18,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=766, Invalid=4176, Unknown=40, NotChecked=420, Total=5402 [2023-12-02 19:36:18,477 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 324 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 76 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:36:18,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 152 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 321 Invalid, 2 Unknown, 397 Unchecked, 10.7s Time] [2023-12-02 19:36:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-02 19:36:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 48. [2023-12-02 19:36:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-12-02 19:36:18,513 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 18 [2023-12-02 19:36:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:36:18,514 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-12-02 19:36:18,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-12-02 19:36:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:36:18,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:36:18,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 19:36:18,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 19:36:18,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:36:18,715 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:36:18,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:36:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1647488412, now seen corresponding path program 4 times [2023-12-02 19:36:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:36:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62176202] [2023-12-02 19:36:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:36:18,737 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:36:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795912191] [2023-12-02 19:36:18,737 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:36:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:36:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:36:18,739 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:36:18,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 19:36:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:19,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 19:36:19,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:19,138 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 [2023-12-02 19:36:19,153 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 11 treesize of output 7 [2023-12-02 19:36:19,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 19:36:19,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 19:36:19,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 19:36:19,338 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-02 19:36:19,338 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 7 case distinctions, treesize of input 40 treesize of output 48 [2023-12-02 19:36:19,403 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 19:36:19,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 58 [2023-12-02 19:36:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:36:19,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:36:20,278 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 [2023-12-02 19:36:21,363 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 [2023-12-02 19:36:31,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 19:36:31,640 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 19:36:31,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:36:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62176202] [2023-12-02 19:36:31,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:36:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795912191] [2023-12-02 19:36:31,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 19:36:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387360166] [2023-12-02 19:36:31,642 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 19:36:31,642 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:36:31,642 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:36:31,642 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:36:31,642 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:36:31,644 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:332) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:223) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2023-12-02 19:36:31,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:36:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2023-12-02 19:36:31,646 ERROR L171 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2023-12-02 19:36:31,647 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2023-12-02 19:36:31,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 19:36:31,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 19:36:31,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:36:31,855 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1] [2023-12-02 19:36:31,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:36:31,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:36:31 BoogieIcfgContainer [2023-12-02 19:36:31,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:36:31,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:36:31,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:36:31,871 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:36:31,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:34:32" (3/4) ... [2023-12-02 19:36:31,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 19:36:31,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:36:31,874 INFO L158 Benchmark]: Toolchain (without parser) took 120100.91ms. Allocated memory was 161.5MB in the beginning and 299.9MB in the end (delta: 138.4MB). Free memory was 131.8MB in the beginning and 141.4MB in the end (delta: -9.6MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2023-12-02 19:36:31,874 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:36:31,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 120.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 19:36:31,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.71ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 119.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:36:31,875 INFO L158 Benchmark]: Boogie Preprocessor took 24.58ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 117.9MB in the end (delta: 842.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:36:31,875 INFO L158 Benchmark]: RCFGBuilder took 349.57ms. Allocated memory is still 161.5MB. Free memory was 117.9MB in the beginning and 101.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 19:36:31,875 INFO L158 Benchmark]: TraceAbstraction took 119484.38ms. Allocated memory was 161.5MB in the beginning and 299.9MB in the end (delta: 138.4MB). Free memory was 100.5MB in the beginning and 141.4MB in the end (delta: -41.0MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2023-12-02 19:36:31,875 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 299.9MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:36:31,876 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 161.5MB. Free memory was 131.8MB in the beginning and 120.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.71ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 119.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.58ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 117.9MB in the end (delta: 842.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.57ms. Allocated memory is still 161.5MB. Free memory was 117.9MB in the beginning and 101.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 119484.38ms. Allocated memory was 161.5MB in the beginning and 299.9MB in the end (delta: 138.4MB). Free memory was 100.5MB in the beginning and 141.4MB in the end (delta: -41.0MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 299.9MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND TRUE !cond [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] long long i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L31] i=0 [L31] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh 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 -> 6c377c3922cafbc07c158cb252290a97b70e1cbfc6e9de773d7729c460f56857 [2023-12-02 19:36:33,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:36:33,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:36:33,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:36:33,940 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:36:33,941 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:36:33,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/array-fpi/ifeqn1.c [2023-12-02 19:36:36,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:36:36,836 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:36:36,837 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/sv-benchmarks/c/array-fpi/ifeqn1.c [2023-12-02 19:36:36,845 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/data/5fd3a66e9/42bca6d835ab44f59779761402bfd1af/FLAG1c4904ba5 [2023-12-02 19:36:36,859 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/data/5fd3a66e9/42bca6d835ab44f59779761402bfd1af [2023-12-02 19:36:36,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:36:36,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:36:36,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:36:36,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:36:36,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:36:36,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:36:36" (1/1) ... [2023-12-02 19:36:36,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33899a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:36, skipping insertion in model container [2023-12-02 19:36:36,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:36:36" (1/1) ... [2023-12-02 19:36:36,894 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:36:37,048 WARN L240 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_e0a10d51-fa55-4201-844a-5266870ee86b/sv-benchmarks/c/array-fpi/ifeqn1.c[589,602] [2023-12-02 19:36:37,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:36:37,086 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:36:37,098 WARN L240 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_e0a10d51-fa55-4201-844a-5266870ee86b/sv-benchmarks/c/array-fpi/ifeqn1.c[589,602] [2023-12-02 19:36:37,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:36:37,125 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:36:37,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37 WrapperNode [2023-12-02 19:36:37,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:36:37,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:36:37,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:36:37,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:36:37,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,164 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2023-12-02 19:36:37,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:36:37,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:36:37,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:36:37,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:36:37,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:36:37,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:36:37,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:36:37,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:36:37,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (1/1) ... [2023-12-02 19:36:37,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:36:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:36:37,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:36:37,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:36:37,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:36:37,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 19:36:37,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2023-12-02 19:36:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:36:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:36:37,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:36:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-12-02 19:36:37,348 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:36:37,350 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:36:37,709 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:36:37,732 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:36:37,732 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 19:36:37,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:36:37 BoogieIcfgContainer [2023-12-02 19:36:37,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:36:37,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:36:37,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:36:37,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:36:37,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:36:36" (1/3) ... [2023-12-02 19:36:37,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212fc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:36:37, skipping insertion in model container [2023-12-02 19:36:37,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:37" (2/3) ... [2023-12-02 19:36:37,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212fc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:36:37, skipping insertion in model container [2023-12-02 19:36:37,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:36:37" (3/3) ... [2023-12-02 19:36:37,742 INFO L112 eAbstractionObserver]: Analyzing ICFG ifeqn1.c [2023-12-02 19:36:37,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:36:37,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:36:37,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:36:37,805 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@15fe4877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:36:37,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:36:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:36:37,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:36:37,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:36:37,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:36:37,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:36:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 323884275, now seen corresponding path program 1 times [2023-12-02 19:36:37,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:36:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13602312] [2023-12-02 19:36:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:37,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:37,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:36:37,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:36:37,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 19:36:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:37,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 19:36:37,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:36:37,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:36:37,959 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:36:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13602312] [2023-12-02 19:36:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13602312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:36:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:36:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:36:37,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238470005] [2023-12-02 19:36:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:36:37,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 19:36:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:36:37,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 19:36:37,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:36:37,991 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:36:38,013 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2023-12-02 19:36:38,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 19:36:38,016 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 19:36:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:36:38,022 INFO L225 Difference]: With dead ends: 37 [2023-12-02 19:36:38,022 INFO L226 Difference]: Without dead ends: 17 [2023-12-02 19:36:38,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 19:36:38,028 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:36:38,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:36:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-02 19:36:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-02 19:36:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-02 19:36:38,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2023-12-02 19:36:38,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:36:38,054 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-02 19:36:38,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-02 19:36:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:36:38,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:36:38,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:36:38,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:36:38,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:38,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:36:38,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:36:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash 993783914, now seen corresponding path program 1 times [2023-12-02 19:36:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:36:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114028373] [2023-12-02 19:36:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:36:38,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:36:38,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 19:36:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:38,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:36:38,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:36:38,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:36:38,513 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:36:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114028373] [2023-12-02 19:36:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114028373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:36:38,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:36:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:36:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796074494] [2023-12-02 19:36:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:36:38,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:36:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:36:38,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:36:38,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:36:38,536 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:36:38,767 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-02 19:36:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:36:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 19:36:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:36:38,776 INFO L225 Difference]: With dead ends: 41 [2023-12-02 19:36:38,777 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 19:36:38,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:36:38,778 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:36:38,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 18 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:36:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 19:36:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-12-02 19:36:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-02 19:36:38,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2023-12-02 19:36:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:36:38,786 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-02 19:36:38,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-02 19:36:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:36:38,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:36:38,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:36:38,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 19:36:38,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:38,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:36:38,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:36:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 334138833, now seen corresponding path program 1 times [2023-12-02 19:36:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:36:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89920430] [2023-12-02 19:36:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:38,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:38,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:36:38,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:36:38,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 19:36:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:39,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 19:36:39,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:39,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:36:39,149 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 16 treesize of output 17 [2023-12-02 19:36:39,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:36:39,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2023-12-02 19:36:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:39,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:36:39,326 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:36:39,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89920430] [2023-12-02 19:36:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89920430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:36:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:36:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 19:36:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810556196] [2023-12-02 19:36:39,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:36:39,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:36:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:36:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:36:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:36:39,329 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:36:39,673 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-12-02 19:36:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:36:39,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 19:36:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:36:39,674 INFO L225 Difference]: With dead ends: 35 [2023-12-02 19:36:39,675 INFO L226 Difference]: Without dead ends: 33 [2023-12-02 19:36:39,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:36:39,677 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:36:39,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 47 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:36:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-02 19:36:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-12-02 19:36:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-12-02 19:36:39,686 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2023-12-02 19:36:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:36:39,686 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-12-02 19:36:39,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-12-02 19:36:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:36:39,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:36:39,688 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:36:39,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 19:36:39,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:39,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:36:39,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:36:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1399034495, now seen corresponding path program 1 times [2023-12-02 19:36:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:36:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037030711] [2023-12-02 19:36:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:39,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:36:39,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:36:39,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 19:36:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:40,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 19:36:40,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:40,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:36:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:40,654 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:36:40,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037030711] [2023-12-02 19:36:40,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037030711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:36:40,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1484318044] [2023-12-02 19:36:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:36:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:36:40,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:36:40,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-02 19:36:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:40,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:36:40,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:41,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:36:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1484318044] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:36:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226688171] [2023-12-02 19:36:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:41,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:36:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:36:41,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:36:41,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:36:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:41,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 19:36:41,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:41,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:36:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:36:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226688171] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:36:41,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:36:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 8, 7] total 17 [2023-12-02 19:36:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015497855] [2023-12-02 19:36:41,465 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:36:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 19:36:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:36:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 19:36:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-02 19:36:41,468 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:36:42,018 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2023-12-02 19:36:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:36:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 19:36:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:36:42,026 INFO L225 Difference]: With dead ends: 69 [2023-12-02 19:36:42,026 INFO L226 Difference]: Without dead ends: 39 [2023-12-02 19:36:42,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-12-02 19:36:42,028 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:36:42,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 46 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:36:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-02 19:36:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2023-12-02 19:36:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-02 19:36:42,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2023-12-02 19:36:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:36:42,035 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-02 19:36:42,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:36:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-02 19:36:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:36:42,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:36:42,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:36:42,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 19:36:42,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-02 19:36:42,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:36:42,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:36:42,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:36:42,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:36:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1256903054, now seen corresponding path program 1 times [2023-12-02 19:36:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:36:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4651424] [2023-12-02 19:36:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:36:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:36:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:36:42,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:36:42,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 19:36:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:36:42,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 19:36:42,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:36:42,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:36:42,859 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 16 treesize of output 17 [2023-12-02 19:36:42,979 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 19:36:42,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 65 [2023-12-02 19:36:43,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:36:43,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 65 [2023-12-02 19:36:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:36:43,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:36:49,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:36:49,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10060 treesize of output 9300 [2023-12-02 19:36:49,354 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 301 treesize of output 241 [2023-12-02 19:36:51,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:36:51,562 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 312403 treesize of output 234391 [2023-12-02 19:37:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:37:11,764 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:37:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4651424] [2023-12-02 19:37:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4651424] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [706710449] [2023-12-02 19:37:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:11,764 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:37:11,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:37:11,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:37:11,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 19:37:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:11,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 19:37:11,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:12,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:12,036 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 16 treesize of output 17 [2023-12-02 19:37:12,101 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 19:37:12,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 65 [2023-12-02 19:37:12,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:37:12,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 65 [2023-12-02 19:37:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 19:37:12,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:37:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [706710449] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281597999] [2023-12-02 19:37:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:37:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:37:15,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:37:15,782 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:37:15,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:37:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:37:15,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 19:37:15,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:37:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:37:16,226 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 16 treesize of output 17 [2023-12-02 19:37:16,316 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 19:37:16,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 65 [2023-12-02 19:37:16,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:37:16,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 65 [2023-12-02 19:37:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:37:16,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:37:17,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:37:17,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10060 treesize of output 9300 [2023-12-02 19:37:17,035 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 301 treesize of output 241 [2023-12-02 19:37:20,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:37:20,013 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 353397 treesize of output 262233 [2023-12-02 19:37:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:37:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281597999] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:37:46,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:37:46,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 7, 10, 8] total 18 [2023-12-02 19:37:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298940369] [2023-12-02 19:37:46,663 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:37:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 19:37:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:37:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 19:37:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=244, Unknown=3, NotChecked=0, Total=306 [2023-12-02 19:37:46,666 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:37:55,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:37:57,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:38:00,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:38:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:03,749 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2023-12-02 19:38:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 19:38:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 19:38:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:03,750 INFO L225 Difference]: With dead ends: 88 [2023-12-02 19:38:03,751 INFO L226 Difference]: Without dead ends: 76 [2023-12-02 19:38:03,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=223, Invalid=766, Unknown=3, NotChecked=0, Total=992 [2023-12-02 19:38:03,752 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 127 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 33 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:03,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 92 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 272 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2023-12-02 19:38:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-02 19:38:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2023-12-02 19:38:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:38:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-12-02 19:38:03,763 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 23 [2023-12-02 19:38:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:03,763 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-12-02 19:38:03,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:38:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-12-02 19:38:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:38:03,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:03,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:03,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 19:38:03,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-02 19:38:04,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 19:38:04,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:04,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:04,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash 879178916, now seen corresponding path program 1 times [2023-12-02 19:38:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:38:04,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256686516] [2023-12-02 19:38:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:04,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:38:04,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:38:04,368 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:38:04,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 19:38:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:04,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 19:38:04,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:04,612 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 [2023-12-02 19:38:04,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:04,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 19:38:04,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-12-02 19:38:05,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:05,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2023-12-02 19:38:05,258 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 19:38:05,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 73 [2023-12-02 19:38:05,828 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-12-02 19:38:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 67 [2023-12-02 19:38:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:05,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:18,298 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:38:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256686516] [2023-12-02 19:38:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256686516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768427655] [2023-12-02 19:38:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:18,298 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:38:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:38:18,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:38:18,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-02 19:38:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:18,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 19:38:18,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:18,791 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 [2023-12-02 19:38:18,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:18,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 19:38:18,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-12-02 19:38:19,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:19,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2023-12-02 19:38:19,107 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 19:38:19,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 73 [2023-12-02 19:38:19,397 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-12-02 19:38:19,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 67 [2023-12-02 19:38:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:19,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1768427655] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301960083] [2023-12-02 19:38:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:23,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:23,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:23,756 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:23,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 19:38:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:23,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 19:38:23,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:24,173 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 [2023-12-02 19:38:24,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 19:38:24,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-12-02 19:38:24,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:24,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2023-12-02 19:38:24,627 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-02 19:38:24,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 73 [2023-12-02 19:38:25,006 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-12-02 19:38:25,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 67 [2023-12-02 19:38:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:25,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301960083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:32,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:38:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 12, 13, 13] total 26 [2023-12-02 19:38:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542365581] [2023-12-02 19:38:32,071 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 19:38:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:38:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 19:38:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=540, Unknown=1, NotChecked=0, Total=650 [2023-12-02 19:38:32,073 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:38:35,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:37,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:39,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:42,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:44,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:46,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:50,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:38:54,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:38:57,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:39:02,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:39:09,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:39:18,777 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse16 ((_ extract 63 32) (_ bv1 64))) (.cse14 ((_ extract 31 0) (_ bv1 64))) (.cse31 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|))) (.cse26 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64)))))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse26)) (.cse7 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse26)) (.cse2 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse9 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse31)) (.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse31)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse24 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse15 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) (.cse11 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse31)) (.cse27 (concat .cse16 .cse14)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= ((_ extract 31 0) (_ bv2 64)) (select .cse0 (_ bv0 32))) (= (_ bv3 64) (let ((.cse1 (let ((.cse4 (store (store .cse13 |c_ULTIMATE.start_main_~b~0#1.offset| .cse14) .cse15 .cse16))) (let ((.cse6 (bvadd (concat (select .cse4 .cse8) (select .cse4 .cse9)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse10 .cse11) (select .cse10 .cse12)))))) (store (store .cse4 .cse5 ((_ extract 31 0) .cse6)) .cse7 ((_ extract 63 32) .cse6)))))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (= (_ bv3 64) (concat (select .cse13 .cse2) (select .cse13 .cse3))) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (= (_ bv3 64) (let ((.cse17 (let ((.cse18 (bvadd (concat (select .cse0 .cse11) (select .cse0 .cse12)) (concat (select .cse13 .cse8) (select .cse13 .cse9))))) (store (store .cse13 .cse5 ((_ extract 31 0) .cse18)) .cse7 ((_ extract 63 32) .cse18))))) (concat (select .cse17 .cse2) (select .cse17 .cse3)))) (= (_ bv3 64) (let ((.cse19 (let ((.cse20 (let ((.cse21 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))))) (bvadd (concat (select .cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse21)) (select .cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse21))) (concat (select .cse13 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse21)) (select .cse13 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse21))))))) (store (store .cse13 .cse9 ((_ extract 31 0) .cse20)) .cse8 ((_ extract 63 32) .cse20))))) (concat (select .cse19 .cse2) (select .cse19 .cse3)))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_127 (_ BitVec 32)) (v_ArrVal_126 (_ BitVec 32))) (= (_ bv3 64) (let ((.cse22 (bvadd (let ((.cse23 (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse26) v_ArrVal_127) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse26) v_ArrVal_126)))) (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse14) .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse23 .cse24) (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse27))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))))) (forall ((v_ArrVal_127 (_ BitVec 32)) (v_ArrVal_126 (_ BitVec 32))) (= (_ bv3 64) (let ((.cse28 (bvadd (let ((.cse29 (select (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse12 v_ArrVal_127) .cse11 v_ArrVal_126)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse14) .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse29 .cse24) (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse27))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))))) (= ((_ extract 63 32) (_ bv2 64)) (select .cse0 (_ bv4 32)))))) is different from true [2023-12-02 19:39:22,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:39:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:22,650 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2023-12-02 19:39:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 19:39:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:39:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:22,652 INFO L225 Difference]: With dead ends: 168 [2023-12-02 19:39:22,652 INFO L226 Difference]: Without dead ends: 136 [2023-12-02 19:39:22,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=538, Invalid=2014, Unknown=2, NotChecked=98, Total=2652 [2023-12-02 19:39:22,655 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 265 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 82 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:22,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 163 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 467 Invalid, 11 Unknown, 25 Unchecked, 29.3s Time] [2023-12-02 19:39:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-02 19:39:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 67. [2023-12-02 19:39:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:39:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2023-12-02 19:39:22,674 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 26 [2023-12-02 19:39:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:22,674 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2023-12-02 19:39:22,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:39:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2023-12-02 19:39:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:39:22,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:39:22,676 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:39:22,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-02 19:39:22,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 19:39:23,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 19:39:23,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:39:23,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:39:23,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:39:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 913699278, now seen corresponding path program 2 times [2023-12-02 19:39:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:39:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188711119] [2023-12-02 19:39:23,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:39:23,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:39:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:39:23,279 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:39:23,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 19:39:23,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:39:23,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:39:23,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 19:39:23,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:39:24,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:39:24,930 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:39:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188711119] [2023-12-02 19:39:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188711119] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:39:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1995232241] [2023-12-02 19:39:24,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:39:24,930 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:39:24,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:39:24,932 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:39:24,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-02 19:39:25,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:39:25,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:39:25,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 19:39:25,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:39:25,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:39:26,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1995232241] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:39:26,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607941764] [2023-12-02 19:39:26,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 19:39:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:39:26,074 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:39:26,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 19:39:26,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 19:39:26,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:39:26,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 19:39:26,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:39:26,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 19:39:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607941764] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:39:26,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:39:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 12, 10, 11, 9] total 28 [2023-12-02 19:39:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628256831] [2023-12-02 19:39:26,934 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:39:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 19:39:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:39:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 19:39:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2023-12-02 19:39:26,936 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 28 states, 28 states have (on average 3.5) internal successors, (98), 28 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:39:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:28,402 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2023-12-02 19:39:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:39:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5) internal successors, (98), 28 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-02 19:39:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:28,414 INFO L225 Difference]: With dead ends: 136 [2023-12-02 19:39:28,414 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 19:39:28,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2023-12-02 19:39:28,416 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:28,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 98 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 19:39:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 19:39:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2023-12-02 19:39:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 72 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:39:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2023-12-02 19:39:28,448 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 29 [2023-12-02 19:39:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:28,448 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2023-12-02 19:39:28,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5) internal successors, (98), 28 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:39:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2023-12-02 19:39:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:39:28,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:39:28,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:39:28,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 19:39:28,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-12-02 19:39:28,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 19:39:29,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:29,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:39:29,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:39:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1445040975, now seen corresponding path program 3 times [2023-12-02 19:39:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:39:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770868902] [2023-12-02 19:39:29,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:39:29,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 19:39:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:39:29,054 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 19:39:29,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 19:39:29,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:39:29,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:39:29,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 19:39:29,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:29,702 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 [2023-12-02 19:39:29,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:39:29,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 19:39:29,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2023-12-02 19:39:30,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-12-02 19:39:30,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:39:30,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 71 [2023-12-02 19:39:30,812 INFO L349 Elim1Store]: treesize reduction 62, result has 19.5 percent of original size [2023-12-02 19:39:30,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 127 treesize of output 105 [2023-12-02 19:39:31,276 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 19:39:31,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 187 treesize of output 139 [2023-12-02 19:39:32,894 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-12-02 19:39:32,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 199 treesize of output 107 [2023-12-02 19:39:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:39:32,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:40:45,551 WARN L293 SmtUtils]: Spent 15.43s on a formula simplification. DAG size of input: 4480 DAG size of output: 192 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 19:40:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:40:46,932 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:40:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770868902] [2023-12-02 19:40:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770868902] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:40:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [402265546] [2023-12-02 19:40:46,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:40:46,932 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:40:46,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:40:46,933 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:40:46,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-02 19:40:48,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:40:48,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:40:48,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:40:48,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:40:52,393 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 [2023-12-02 19:40:53,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:40:53,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2023-12-02 19:40:54,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:40:54,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2023-12-02 19:40:54,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:40:54,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 64 [2023-12-02 19:40:56,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:40:56,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:40:56,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 80 [2023-12-02 19:40:56,879 INFO L349 Elim1Store]: treesize reduction 62, result has 19.5 percent of original size [2023-12-02 19:40:56,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 141 treesize of output 114 [2023-12-02 19:40:58,072 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-02 19:40:58,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 177 treesize of output 156 [2023-12-02 19:41:04,622 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-12-02 19:41:04,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 21 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 245 treesize of output 141 [2023-12-02 19:41:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:41:04,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:43:18,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:43:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:43:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [402265546] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:43:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511723880] [2023-12-02 19:43:18,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:43:18,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:43:18,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:43:18,740 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:43:18,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0a10d51-fa55-4201-844a-5266870ee86b/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 19:43:19,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:43:19,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:43:19,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 19:43:19,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:21,829 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 [2023-12-02 19:43:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:43:22,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-02 19:43:22,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2023-12-02 19:43:22,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-12-02 19:43:23,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2023-12-02 19:43:23,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 97 [2023-12-02 19:43:24,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 135 [2023-12-02 19:43:36,198 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-12-02 19:43:36,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 199 treesize of output 107 [2023-12-02 19:43:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:43:36,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:44:40,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse8 (let ((.cse9 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (bvadd (concat (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse9)) (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse9))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse9)) (select .cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse9)))))))) (let ((.cse5 ((_ extract 31 0) .cse8)) (.cse7 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse4 ((_ extract 63 32) .cse8))) (let ((.cse1 (store (store v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse7) .cse5) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse7) .cse4))) (let ((.cse2 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|)))) (.cse3 (bvadd (concat .cse4 .cse5) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse7)) (select .cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))))))) (store (store .cse1 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse2) ((_ extract 31 0) .cse3)) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse2) ((_ extract 63 32) .cse3)))))))) (or (not (= (_ bv3 64) (concat (select .cse0 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)))))) (= (concat (select .cse0 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv20 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv16 32)))) (_ bv7 64))))) is different from false [2023-12-02 19:44:42,305 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse1 ((_ extract 31 0) .cse4)) (.cse0 ((_ extract 63 32) .cse4))) (or (not (= (_ bv3 64) (concat .cse0 .cse1))) (= (let ((.cse2 (bvadd (_ bv3 64) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)) .cse1) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32)) .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32)))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) (_ bv7 64)))))) is different from false [2023-12-02 19:44:42,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) v_ArrVal_323) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse7) v_ArrVal_322))))) (let ((.cse5 (bvadd (let ((.cse6 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse1 ((_ extract 31 0) .cse5)) (.cse0 ((_ extract 63 32) .cse5))) (or (not (= (_ bv3 64) (concat .cse0 .cse1))) (= (_ bv7 64) (let ((.cse2 (bvadd (_ bv3 64) (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)) .cse1) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32)) .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32)))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))))))))) is different from false [2023-12-02 19:45:21,359 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64)))))) (store (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|))) (.cse9 (bvadd (let ((.cse10 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))))) (concat (select .cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse10)) (select .cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (_ bv2 64)))) (store (store .cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) ((_ extract 31 0) .cse9)) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse8) ((_ extract 63 32) .cse9)))) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) v_ArrVal_323) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse11) v_ArrVal_322))))) (let ((.cse5 (bvadd (let ((.cse6 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse1 ((_ extract 31 0) .cse5)) (.cse0 ((_ extract 63 32) .cse5))) (or (not (= (_ bv3 64) (concat .cse0 .cse1))) (= (let ((.cse2 (bvadd (_ bv3 64) (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)) .cse1) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32)) .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32)))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) (_ bv7 64))))))) is different from false [2023-12-02 19:45:23,098 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|))))) (store (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse9 (bvadd (let ((.cse10 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (concat (select .cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse10)) (select .cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (_ bv2 64)))) (store (store .cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) ((_ extract 31 0) .cse9)) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse8) ((_ extract 63 32) .cse9)))) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) v_ArrVal_323) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse11) v_ArrVal_322))))) (let ((.cse5 (bvadd (let ((.cse6 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse1 ((_ extract 31 0) .cse5)) (.cse0 ((_ extract 63 32) .cse5))) (or (not (= (_ bv3 64) (concat .cse0 .cse1))) (= (let ((.cse2 (bvadd (_ bv3 64) (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)) .cse1) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32)) .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (select .cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32)))))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) (_ bv7 64))))))) is different from false [2023-12-02 19:45:23,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:45:23,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3868 treesize of output 526 [2023-12-02 19:45:23,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 804 treesize of output 750 [2023-12-02 19:45:24,629 INFO L349 Elim1Store]: treesize reduction 22, result has 51.1 percent of original size [2023-12-02 19:45:24,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 14149572 treesize of output 12181466 [2023-12-02 19:45:26,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:45:26,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5125 treesize of output 3453 [2023-12-02 19:46:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2023-12-02 19:46:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511723880] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:46:21,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:46:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 22, 20, 19, 20] total 96 [2023-12-02 19:46:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305651138] [2023-12-02 19:46:21,434 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:46:21,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-02 19:46:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:46:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-02 19:46:21,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=7110, Unknown=80, NotChecked=910, Total=9120 [2023-12-02 19:46:21,441 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 96 states, 96 states have (on average 1.8333333333333333) internal successors, (176), 96 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:46:40,085 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse104 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|))) (.cse105 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse64 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse98 (select .cse64 (_ bv4 32))) (.cse19 (select .cse64 (_ bv0 32))) (.cse15 ((_ extract 63 32) (_ bv1 64))) (.cse13 ((_ extract 31 0) (_ bv1 64))) (.cse99 ((_ sign_extend 32) c_~N~0)) (.cse102 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|)))) (.cse29 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse105)) (.cse30 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse105)) (.cse66 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse104)) (.cse65 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse104))) (let ((.cse16 (let ((.cse103 (bvadd (concat (select .cse64 .cse66) (select .cse64 .cse65)) (_ bv2 64)))) (store (store .cse64 .cse29 ((_ extract 31 0) .cse103)) .cse30 ((_ extract 63 32) .cse103)))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse102)) (.cse18 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse102)) (.cse28 (let ((.cse100 (bvadd (let ((.cse101 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))))) (concat (select .cse64 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse101)) (select .cse64 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse101)))) (_ bv2 64)))) (store (store .cse64 .cse65 ((_ extract 31 0) .cse100)) .cse66 ((_ extract 63 32) .cse100)))) (.cse31 (bvslt (_ bv3 64) .cse99)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse39 (concat .cse15 .cse13)) (.cse14 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse41 (not (bvslt (_ bv2 64) .cse99))) (.cse89 (bvadd (_ bv2 64) (concat .cse98 .cse19)))) (and (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_255) .cse18 v_ArrVal_254)))) (let ((.cse5 (store (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse10 (bvadd (let ((.cse11 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse11 .cse12) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse9 ((_ extract 63 32) .cse10)) (.cse7 ((_ extract 31 0) .cse10))) (or (= (let ((.cse0 (bvadd (_ bv3 64) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse5 .cse6 .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse9 .cse7))))))))) (= ((_ extract 31 0) (_ bv2 64)) .cse19) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse28 .cse29 v_ArrVal_255) .cse30 v_ArrVal_254)))) (let ((.cse23 (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse26 (bvadd (let ((.cse27 (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse27 .cse12) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse25 ((_ extract 63 32) .cse26)) (.cse24 ((_ extract 31 0) .cse26))) (or (= (let ((.cse20 (bvadd (_ bv3 64) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse23 .cse6 .cse24) .cse8 .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse21 .cse2) (select .cse21 .cse3)))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse25 .cse24))))))))) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse32 (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_289) .cse18 v_ArrVal_288)))) (let ((.cse37 (store (store (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse38 (bvadd .cse39 (let ((.cse40 (select (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse40 .cse12) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse34 ((_ extract 31 0) .cse38)) (.cse33 ((_ extract 63 32) .cse38))) (bvadd (concat .cse33 .cse34) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse37 .cse6 .cse34) .cse8 .cse33)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse35 .cse2) (select .cse35 .cse3)))))))))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))))) .cse41) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse42 (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse28 .cse29 v_ArrVal_289) .cse30 v_ArrVal_288)))) (let ((.cse47 (store (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse48 (bvadd (let ((.cse49 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse49 .cse12) (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse39))) (let ((.cse44 ((_ extract 31 0) .cse48)) (.cse43 ((_ extract 63 32) .cse48))) (bvadd (concat .cse43 .cse44) (let ((.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse47 .cse6 .cse44) .cse8 .cse43)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse45 .cse2) (select .cse45 .cse3)))))))))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))))) .cse41) (not (bvsle c_~N~0 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| (_ bv1 32)) (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (bvadd (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse51 ((_ extract 31 0) .cse54)) (.cse50 ((_ extract 63 32) .cse54))) (or (not (= (_ bv3 64) (concat .cse50 .cse51))) (= (let ((.cse52 (bvadd (_ bv3 64) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse51) .cse8 .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse53 .cse2) (select .cse53 .cse3)))))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) (_ bv7 64)))))) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse65 v_ArrVal_255) .cse66 v_ArrVal_254)))) (let ((.cse61 (store (store (select .cse60 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse62 (bvadd (let ((.cse63 (select (store .cse60 |c_ULTIMATE.start_main_~b~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse63 .cse12) (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse57 ((_ extract 31 0) .cse62)) (.cse56 ((_ extract 63 32) .cse62))) (or (not (= (_ bv3 64) (concat .cse56 .cse57))) (= (let ((.cse58 (bvadd (_ bv3 64) (let ((.cse59 (select (store .cse60 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse61 .cse6 .cse57) .cse8 .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse59 .cse2) (select .cse59 .cse3)))))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) (_ bv7 64)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse65 v_ArrVal_323) .cse66 v_ArrVal_322)))) (let ((.cse72 (bvadd (let ((.cse73 (select (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse73 .cse12) (select .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse68 ((_ extract 31 0) .cse72)) (.cse67 ((_ extract 63 32) .cse72))) (or (not (= (_ bv3 64) (concat .cse67 .cse68))) (= (_ bv7 64) (let ((.cse69 (bvadd (_ bv3 64) (let ((.cse70 (select (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse68) .cse8 .cse67)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse70 .cse2) (select .cse70 .cse3)))))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))))))))) (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse29 v_ArrVal_323) .cse30 v_ArrVal_322)))) (let ((.cse79 (bvadd (let ((.cse80 (select (store .cse76 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse80 .cse12) (select .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse78 ((_ extract 63 32) .cse79)) (.cse77 ((_ extract 31 0) .cse79))) (or (= (let ((.cse74 (bvadd (_ bv3 64) (let ((.cse75 (select (store .cse76 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse77) .cse8 .cse78)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse75 .cse2) (select .cse75 .cse3)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse78 .cse77)))))))) (bvule c_~N~0 (_ bv536870911 32)) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse81 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse29 v_ArrVal_289) .cse30 v_ArrVal_288)))) (let ((.cse84 (store (store (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse87 (bvadd (let ((.cse88 (select (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| .cse84) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse88 .cse12) (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse39))) (let ((.cse86 ((_ extract 63 32) .cse87)) (.cse85 ((_ extract 31 0) .cse87))) (bvadd (let ((.cse82 (select (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse84 .cse6 .cse85) .cse8 .cse86)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse82 .cse2) (select .cse82 .cse3))) (concat .cse86 .cse85)))))))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) (_ bv7 64))) .cse41) (= (select .cse64 (_ bv12 32)) ((_ extract 63 32) .cse89)) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse90 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse65 v_ArrVal_289) .cse66 v_ArrVal_288)))) (let ((.cse93 (store (store (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse96 (bvadd (let ((.cse97 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse93) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse97 .cse12) (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse39))) (let ((.cse95 ((_ extract 63 32) .cse96)) (.cse94 ((_ extract 31 0) .cse96))) (bvadd (let ((.cse91 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse93 .cse6 .cse94) .cse8 .cse95)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse91 .cse2) (select .cse91 .cse3))) (concat .cse95 .cse94)))))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) (_ bv7 64))) .cse41) (= (select .cse64 (_ bv8 32)) ((_ extract 31 0) .cse89)) (= ((_ extract 63 32) (_ bv2 64)) .cse98))))) is different from false [2023-12-02 19:46:42,106 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse104 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|))) (.cse105 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse64 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse98 (select .cse64 (_ bv4 32))) (.cse19 (select .cse64 (_ bv0 32))) (.cse15 ((_ extract 63 32) (_ bv1 64))) (.cse13 ((_ extract 31 0) (_ bv1 64))) (.cse99 ((_ sign_extend 32) c_~N~0)) (.cse102 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|)))) (.cse29 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse105)) (.cse30 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse105)) (.cse66 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse104)) (.cse65 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse104))) (let ((.cse16 (let ((.cse103 (bvadd (concat (select .cse64 .cse66) (select .cse64 .cse65)) (_ bv2 64)))) (store (store .cse64 .cse29 ((_ extract 31 0) .cse103)) .cse30 ((_ extract 63 32) .cse103)))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse102)) (.cse18 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse102)) (.cse28 (let ((.cse100 (bvadd (let ((.cse101 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))))) (concat (select .cse64 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse101)) (select .cse64 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse101)))) (_ bv2 64)))) (store (store .cse64 .cse65 ((_ extract 31 0) .cse100)) .cse66 ((_ extract 63 32) .cse100)))) (.cse31 (bvslt (_ bv3 64) .cse99)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse39 (concat .cse15 .cse13)) (.cse14 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse41 (not (bvslt (_ bv2 64) .cse99))) (.cse89 (bvadd (_ bv2 64) (concat .cse98 .cse19)))) (and (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_255) .cse18 v_ArrVal_254)))) (let ((.cse5 (store (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse10 (bvadd (let ((.cse11 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse11 .cse12) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse9 ((_ extract 63 32) .cse10)) (.cse7 ((_ extract 31 0) .cse10))) (or (= (let ((.cse0 (bvadd (_ bv3 64) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse5 .cse6 .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse9 .cse7))))))))) (= ((_ extract 31 0) (_ bv2 64)) .cse19) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse28 .cse29 v_ArrVal_255) .cse30 v_ArrVal_254)))) (let ((.cse23 (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse26 (bvadd (let ((.cse27 (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse27 .cse12) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse25 ((_ extract 63 32) .cse26)) (.cse24 ((_ extract 31 0) .cse26))) (or (= (let ((.cse20 (bvadd (_ bv3 64) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse23 .cse6 .cse24) .cse8 .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse21 .cse2) (select .cse21 .cse3)))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse25 .cse24))))))))) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse32 (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_289) .cse18 v_ArrVal_288)))) (let ((.cse37 (store (store (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse38 (bvadd .cse39 (let ((.cse40 (select (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse40 .cse12) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse34 ((_ extract 31 0) .cse38)) (.cse33 ((_ extract 63 32) .cse38))) (bvadd (concat .cse33 .cse34) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse37 .cse6 .cse34) .cse8 .cse33)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse35 .cse2) (select .cse35 .cse3)))))))))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))))) .cse41) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse42 (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse28 .cse29 v_ArrVal_289) .cse30 v_ArrVal_288)))) (let ((.cse47 (store (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse48 (bvadd (let ((.cse49 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse49 .cse12) (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse39))) (let ((.cse44 ((_ extract 31 0) .cse48)) (.cse43 ((_ extract 63 32) .cse48))) (bvadd (concat .cse43 .cse44) (let ((.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse47 .cse6 .cse44) .cse8 .cse43)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse45 .cse2) (select .cse45 .cse3)))))))))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))))) .cse41) (not (bvsle c_~N~0 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| (_ bv1 32)) (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (bvadd (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse51 ((_ extract 31 0) .cse54)) (.cse50 ((_ extract 63 32) .cse54))) (or (not (= (_ bv3 64) (concat .cse50 .cse51))) (= (let ((.cse52 (bvadd (_ bv3 64) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse51) .cse8 .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse53 .cse2) (select .cse53 .cse3)))))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) (_ bv7 64)))))) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse65 v_ArrVal_255) .cse66 v_ArrVal_254)))) (let ((.cse61 (store (store (select .cse60 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse62 (bvadd (let ((.cse63 (select (store .cse60 |c_ULTIMATE.start_main_~b~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse63 .cse12) (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse57 ((_ extract 31 0) .cse62)) (.cse56 ((_ extract 63 32) .cse62))) (or (not (= (_ bv3 64) (concat .cse56 .cse57))) (= (let ((.cse58 (bvadd (_ bv3 64) (let ((.cse59 (select (store .cse60 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse61 .cse6 .cse57) .cse8 .cse56)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse59 .cse2) (select .cse59 .cse3)))))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) (_ bv7 64)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse65 v_ArrVal_323) .cse66 v_ArrVal_322)))) (let ((.cse72 (bvadd (let ((.cse73 (select (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse73 .cse12) (select .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse68 ((_ extract 31 0) .cse72)) (.cse67 ((_ extract 63 32) .cse72))) (or (not (= (_ bv3 64) (concat .cse67 .cse68))) (= (_ bv7 64) (let ((.cse69 (bvadd (_ bv3 64) (let ((.cse70 (select (store .cse71 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse68) .cse8 .cse67)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse70 .cse2) (select .cse70 .cse3)))))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))))))))) (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse29 v_ArrVal_323) .cse30 v_ArrVal_322)))) (let ((.cse79 (bvadd (let ((.cse80 (select (store .cse76 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse80 .cse12) (select .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse78 ((_ extract 63 32) .cse79)) (.cse77 ((_ extract 31 0) .cse79))) (or (= (let ((.cse74 (bvadd (_ bv3 64) (let ((.cse75 (select (store .cse76 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse77) .cse8 .cse78)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse75 .cse2) (select .cse75 .cse3)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse78 .cse77)))))))) (bvule c_~N~0 (_ bv536870911 32)) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse81 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse29 v_ArrVal_289) .cse30 v_ArrVal_288)))) (let ((.cse84 (store (store (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse87 (bvadd (let ((.cse88 (select (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| .cse84) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse88 .cse12) (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse39))) (let ((.cse86 ((_ extract 63 32) .cse87)) (.cse85 ((_ extract 31 0) .cse87))) (bvadd (let ((.cse82 (select (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse84 .cse6 .cse85) .cse8 .cse86)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse82 .cse2) (select .cse82 .cse3))) (concat .cse86 .cse85)))))))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) (_ bv7 64))) .cse41) (= (select .cse64 (_ bv12 32)) ((_ extract 63 32) .cse89)) (or .cse31 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse90 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse64 .cse65 v_ArrVal_289) .cse66 v_ArrVal_288)))) (let ((.cse93 (store (store (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse96 (bvadd (let ((.cse97 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse93) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse97 .cse12) (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse39))) (let ((.cse95 ((_ extract 63 32) .cse96)) (.cse94 ((_ extract 31 0) .cse96))) (bvadd (let ((.cse91 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse93 .cse6 .cse94) .cse8 .cse95)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse91 .cse2) (select .cse91 .cse3))) (concat .cse95 .cse94)))))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) (_ bv7 64))) .cse41) (= (select .cse64 (_ bv8 32)) ((_ extract 31 0) .cse89)) (= ((_ extract 63 32) (_ bv2 64)) .cse98))))) is different from true [2023-12-02 19:46:45,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse60 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse15 ((_ extract 63 32) (_ bv1 64))) (.cse13 ((_ extract 31 0) (_ bv1 64))) (.cse56 ((_ sign_extend 32) c_~N~0)) (.cse57 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse39 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) (.cse40 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse60)) (.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (let ((.cse58 (bvadd (let ((.cse59 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))))) (concat (select .cse38 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse59)) (select .cse38 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse59)))) (_ bv2 64)))) (store (store .cse38 .cse39 ((_ extract 31 0) .cse58)) .cse40 ((_ extract 63 32) .cse58)))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse57)) (.cse18 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse57)) (.cse19 (bvslt (_ bv3 64) .cse56)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse28 (concat .cse15 .cse13)) (.cse14 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse29 (not (bvslt (_ bv2 64) .cse56)))) (and (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_255) .cse18 v_ArrVal_254)))) (let ((.cse5 (store (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse10 (bvadd (let ((.cse11 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse11 .cse12) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse9 ((_ extract 63 32) .cse10)) (.cse7 ((_ extract 31 0) .cse10))) (or (= (let ((.cse0 (bvadd (_ bv3 64) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse5 .cse6 .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse9 .cse7))))))))) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (or .cse19 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse20 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_289) .cse18 v_ArrVal_288)))) (let ((.cse25 (store (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse26 (bvadd (let ((.cse27 (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse27 .cse12) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse28))) (let ((.cse22 ((_ extract 31 0) .cse26)) (.cse21 ((_ extract 63 32) .cse26))) (bvadd (concat .cse21 .cse22) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse25 .cse6 .cse22) .cse8 .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse23 .cse2) (select .cse23 .cse3)))))))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))))) .cse29) (not (bvsle c_~N~0 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| (_ bv1 32)) (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse39 v_ArrVal_255) .cse40 v_ArrVal_254)))) (let ((.cse35 (store (store (select .cse34 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse36 (bvadd (let ((.cse37 (select (store .cse34 |c_ULTIMATE.start_main_~b~0#1.base| .cse35) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse37 .cse12) (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse31 ((_ extract 31 0) .cse36)) (.cse30 ((_ extract 63 32) .cse36))) (or (not (= (_ bv3 64) (concat .cse30 .cse31))) (= (let ((.cse32 (bvadd (_ bv3 64) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse35 .cse6 .cse31) .cse8 .cse30)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse33 .cse2) (select .cse33 .cse3)))))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))) (_ bv7 64)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse39 v_ArrVal_323) .cse40 v_ArrVal_322)))) (let ((.cse46 (bvadd (let ((.cse47 (select (store .cse45 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse47 .cse12) (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse46)) (.cse41 ((_ extract 63 32) .cse46))) (or (not (= (_ bv3 64) (concat .cse41 .cse42))) (= (_ bv7 64) (let ((.cse43 (bvadd (_ bv3 64) (let ((.cse44 (select (store .cse45 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse42) .cse8 .cse41)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse44 .cse2) (select .cse44 .cse3)))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))))))))) (bvule c_~N~0 (_ bv536870911 32)) (or .cse19 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse48 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse39 v_ArrVal_289) .cse40 v_ArrVal_288)))) (let ((.cse51 (store (store (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse54 (bvadd (let ((.cse55 (select (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse28))) (let ((.cse53 ((_ extract 63 32) .cse54)) (.cse52 ((_ extract 31 0) .cse54))) (bvadd (let ((.cse49 (select (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse51 .cse6 .cse52) .cse8 .cse53)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse49 .cse2) (select .cse49 .cse3))) (concat .cse53 .cse52)))))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) (_ bv7 64))) .cse29))))) is different from false [2023-12-02 19:46:47,844 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse60 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse15 ((_ extract 63 32) (_ bv1 64))) (.cse13 ((_ extract 31 0) (_ bv1 64))) (.cse56 ((_ sign_extend 32) c_~N~0)) (.cse57 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse39 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) (.cse40 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse60)) (.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (let ((.cse58 (bvadd (let ((.cse59 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))))) (concat (select .cse38 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse59)) (select .cse38 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse59)))) (_ bv2 64)))) (store (store .cse38 .cse39 ((_ extract 31 0) .cse58)) .cse40 ((_ extract 63 32) .cse58)))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse57)) (.cse18 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse57)) (.cse19 (bvslt (_ bv3 64) .cse56)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse28 (concat .cse15 .cse13)) (.cse14 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse29 (not (bvslt (_ bv2 64) .cse56)))) (and (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_255) .cse18 v_ArrVal_254)))) (let ((.cse5 (store (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse10 (bvadd (let ((.cse11 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse11 .cse12) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse9 ((_ extract 63 32) .cse10)) (.cse7 ((_ extract 31 0) .cse10))) (or (= (let ((.cse0 (bvadd (_ bv3 64) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse5 .cse6 .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse9 .cse7))))))))) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (or .cse19 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse20 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_289) .cse18 v_ArrVal_288)))) (let ((.cse25 (store (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse26 (bvadd (let ((.cse27 (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse27 .cse12) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse28))) (let ((.cse22 ((_ extract 31 0) .cse26)) (.cse21 ((_ extract 63 32) .cse26))) (bvadd (concat .cse21 .cse22) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse25 .cse6 .cse22) .cse8 .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse23 .cse2) (select .cse23 .cse3)))))))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))))) .cse29) (not (bvsle c_~N~0 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| (_ bv1 32)) (_ bv1 32)) ((_ sign_extend 24) (_ bv0 8))) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse39 v_ArrVal_255) .cse40 v_ArrVal_254)))) (let ((.cse35 (store (store (select .cse34 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse36 (bvadd (let ((.cse37 (select (store .cse34 |c_ULTIMATE.start_main_~b~0#1.base| .cse35) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse37 .cse12) (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse31 ((_ extract 31 0) .cse36)) (.cse30 ((_ extract 63 32) .cse36))) (or (not (= (_ bv3 64) (concat .cse30 .cse31))) (= (let ((.cse32 (bvadd (_ bv3 64) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse35 .cse6 .cse31) .cse8 .cse30)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse33 .cse2) (select .cse33 .cse3)))))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))) (_ bv7 64)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_323 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse39 v_ArrVal_323) .cse40 v_ArrVal_322)))) (let ((.cse46 (bvadd (let ((.cse47 (select (store .cse45 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse47 .cse12) (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse14) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse46)) (.cse41 ((_ extract 63 32) .cse46))) (or (not (= (_ bv3 64) (concat .cse41 .cse42))) (= (_ bv7 64) (let ((.cse43 (bvadd (_ bv3 64) (let ((.cse44 (select (store .cse45 |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse42) .cse8 .cse41)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse44 .cse2) (select .cse44 .cse3)))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))))))))) (bvule c_~N~0 (_ bv536870911 32)) (or .cse19 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse48 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 .cse39 v_ArrVal_289) .cse40 v_ArrVal_288)))) (let ((.cse51 (store (store (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse54 (bvadd (let ((.cse55 (select (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse28))) (let ((.cse53 ((_ extract 63 32) .cse54)) (.cse52 ((_ extract 31 0) .cse54))) (bvadd (let ((.cse49 (select (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse51 .cse6 .cse52) .cse8 .cse53)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse49 .cse2) (select .cse49 .cse3))) (concat .cse53 .cse52)))))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) (_ bv7 64))) .cse29))))) is different from true [2023-12-02 19:46:51,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse44 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse23 ((_ extract 63 32) (_ bv1 64))) (.cse22 ((_ extract 31 0) (_ bv1 64))) (.cse43 ((_ sign_extend 32) c_~N~0))) (let ((.cse12 (bvslt (_ bv3 64) .cse43)) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse7 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse21 (concat .cse23 .cse22)) (.cse11 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse33 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse44)) (.cse34 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse44)) (.cse13 (not (bvslt (_ bv2 64) .cse43)))) (and (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse9 .cse10) (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse11) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse1 ((_ extract 31 0) .cse8)) (.cse0 ((_ extract 63 32) .cse8))) (or (not (= (_ bv3 64) (concat .cse0 .cse1))) (= (let ((.cse2 (bvadd (_ bv3 64) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse1) .cse7 .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse3 .cse4) (select .cse3 .cse5)))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) (_ bv7 64)))))) (or .cse12 .cse13 (= (let ((.cse14 (let ((.cse18 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse22) .cse11 .cse23))) (let ((.cse19 (bvadd (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse20 .cse10) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse21))) (let ((.cse16 ((_ extract 31 0) .cse19)) (.cse15 ((_ extract 63 32) .cse19))) (bvadd (concat .cse15 .cse16) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse18 .cse6 .cse16) .cse7 .cse15)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse17 .cse4) (select .cse17 .cse5))))))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) (_ bv7 64))) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse32 .cse33 v_ArrVal_255) .cse34 v_ArrVal_254)))) (let ((.cse27 (store (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse22) .cse11 .cse23))) (let ((.cse30 (bvadd (let ((.cse31 (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse31 .cse10) (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse29 ((_ extract 63 32) .cse30)) (.cse28 ((_ extract 31 0) .cse30))) (or (= (_ bv7 64) (let ((.cse24 (bvadd (_ bv3 64) (let ((.cse25 (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse27 .cse6 .cse28) .cse7 .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse25 .cse4) (select .cse25 .cse5)))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))) (not (= (_ bv3 64) (concat .cse29 .cse28))))))))) (or .cse12 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse35 (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse32 .cse33 v_ArrVal_289) .cse34 v_ArrVal_288)))) (let ((.cse38 (store (store (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse22) .cse11 .cse23))) (let ((.cse41 (bvadd (let ((.cse42 (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse42 .cse10) (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse21))) (let ((.cse40 ((_ extract 63 32) .cse41)) (.cse39 ((_ extract 31 0) .cse41))) (bvadd (let ((.cse36 (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse38 .cse6 .cse39) .cse7 .cse40)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse36 .cse4) (select .cse36 .cse5))) (concat .cse40 .cse39)))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) (_ bv7 64))) .cse13)))) is different from false [2023-12-02 19:46:55,937 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse44 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|))) (.cse21 ((_ extract 63 32) (_ bv1 64))) (.cse20 ((_ extract 31 0) (_ bv1 64))) (.cse43 ((_ sign_extend 32) c_~N~0))) (let ((.cse25 (bvslt (_ bv3 64) .cse43)) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse7 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse10 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse34 (concat .cse21 .cse20)) (.cse11 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse44)) (.cse24 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse44)) (.cse26 (not (bvslt (_ bv2 64) .cse43)))) (and (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse9 .cse10) (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse11) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse1 ((_ extract 31 0) .cse8)) (.cse0 ((_ extract 63 32) .cse8))) (or (not (= (_ bv3 64) (concat .cse0 .cse1))) (= (let ((.cse2 (bvadd (_ bv3 64) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse6 .cse1) .cse7 .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse3 .cse4) (select .cse3 .cse5)))))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) (_ bv7 64)))))) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse22 .cse23 v_ArrVal_255) .cse24 v_ArrVal_254)))) (let ((.cse17 (store (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse20) .cse11 .cse21))) (let ((.cse18 (bvadd (let ((.cse19 (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse19 .cse10) (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse13 ((_ extract 31 0) .cse18)) (.cse12 ((_ extract 63 32) .cse18))) (or (not (= (_ bv3 64) (concat .cse12 .cse13))) (= (let ((.cse14 (bvadd (_ bv3 64) (let ((.cse15 (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse17 .cse6 .cse13) .cse7 .cse12)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse15 .cse4) (select .cse15 .cse5)))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) (_ bv7 64)))))))) (or .cse25 .cse26 (= (let ((.cse27 (let ((.cse31 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse20) .cse11 .cse21))) (let ((.cse32 (bvadd (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse31) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse33 .cse10) (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse34))) (let ((.cse29 ((_ extract 31 0) .cse32)) (.cse28 ((_ extract 63 32) .cse32))) (bvadd (concat .cse28 .cse29) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse31 .cse6 .cse29) .cse7 .cse28)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse30 .cse4) (select .cse30 .cse5))))))))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))) (_ bv7 64))) (or .cse25 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse35 (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse22 .cse23 v_ArrVal_289) .cse24 v_ArrVal_288)))) (let ((.cse38 (store (store (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse20) .cse11 .cse21))) (let ((.cse41 (bvadd (let ((.cse42 (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse42 .cse10) (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse34))) (let ((.cse40 ((_ extract 63 32) .cse41)) (.cse39 ((_ extract 31 0) .cse41))) (bvadd (let ((.cse36 (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse38 .cse6 .cse39) .cse7 .cse40)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse36 .cse4) (select .cse36 .cse5))) (concat .cse40 .cse39)))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) (_ bv7 64))) .cse26)))) is different from false [2023-12-02 19:46:59,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 ((_ extract 31 0) (_ bv1 64))) (.cse18 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse25 ((_ extract 63 32) (_ bv1 64)))) (let ((.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse26) .cse18 .cse25))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse5 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse7 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse10 (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse27 .cse17) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (and (let ((.cse9 (bvadd .cse10 (_ bv1 64)))) (let ((.cse8 ((_ extract 63 32) .cse9)) (.cse6 ((_ extract 31 0) .cse9))) (or (= (let ((.cse0 (bvadd (_ bv3 64) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse4 .cse5 .cse6) .cse7 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse8 .cse6)))))) (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (bvadd (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse16 .cse17) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (concat (select v_ArrVal_325 .cse18) (select v_ArrVal_325 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse12 ((_ extract 31 0) .cse15)) (.cse11 ((_ extract 63 32) .cse15))) (or (not (= (_ bv3 64) (concat .cse11 .cse12))) (= (let ((.cse13 (bvadd (_ bv3 64) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store v_ArrVal_325 .cse5 .cse12) .cse7 .cse11)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse14 .cse2) (select .cse14 .cse3)))))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) (_ bv7 64)))))) (let ((.cse19 ((_ sign_extend 32) c_~N~0))) (or (bvslt (_ bv3 64) .cse19) (not (bvslt (_ bv2 64) .cse19)) (= (let ((.cse20 (let ((.cse24 (bvadd .cse10 (concat .cse25 .cse26)))) (let ((.cse22 ((_ extract 31 0) .cse24)) (.cse21 ((_ extract 63 32) .cse24))) (bvadd (concat .cse21 .cse22) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse4 .cse5 .cse22) .cse7 .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse23 .cse2) (select .cse23 .cse3)))))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))) (_ bv7 64)))))))) is different from false [2023-12-02 19:47:23,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse29 ((_ extract 31 0) (_ bv1 64))) (.cse28 ((_ extract 63 32) (_ bv1 64)))) (let ((.cse17 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse29) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32)) .cse28))) (let ((.cse15 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse16 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse2 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse1 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse21 (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse30 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (and (forall ((v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse10 (let ((.cse11 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (bvadd (concat (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse11)) (select v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse11))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse11)) (select .cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse11)))))))) (let ((.cse7 ((_ extract 31 0) .cse10)) (.cse9 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))))) (.cse6 ((_ extract 63 32) .cse10))) (let ((.cse3 (store (store v_ArrVal_325 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse9) .cse7) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse9) .cse6))) (let ((.cse4 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|)))) (.cse5 (bvadd (concat .cse6 .cse7) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse9)) (select .cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))))))) (store (store .cse3 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse4) ((_ extract 31 0) .cse5)) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse4) ((_ extract 63 32) .cse5)))))))) (or (not (= (_ bv3 64) (concat (select .cse0 .cse1) (select .cse0 .cse2)))) (= (concat (select .cse0 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv20 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv16 32)))) (_ bv7 64))))) (let ((.cse20 (bvadd .cse21 (_ bv1 64)))) (let ((.cse19 ((_ extract 63 32) .cse20)) (.cse18 ((_ extract 31 0) .cse20))) (or (= (let ((.cse13 (bvadd (_ bv3 64) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse17 .cse2 .cse18) .cse1 .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse14 .cse15) (select .cse14 .cse16)))))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse19 .cse18)))))) (let ((.cse22 ((_ sign_extend 32) c_~N~0))) (or (bvslt (_ bv3 64) .cse22) (not (bvslt (_ bv2 64) .cse22)) (= (let ((.cse23 (let ((.cse27 (bvadd .cse21 (concat .cse28 .cse29)))) (let ((.cse25 ((_ extract 31 0) .cse27)) (.cse24 ((_ extract 63 32) .cse27))) (bvadd (concat .cse24 .cse25) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse17 .cse2 .cse25) .cse1 .cse24)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse26 .cse15) (select .cse26 .cse16)))))))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) (_ bv7 64)))))))) is different from false [2023-12-02 19:47:26,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:29,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:37,873 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse114 (bvmul (_ bv8 32) ((_ extract 31 0) |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse44 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse114)) (.cse56 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse45 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse114))) (let ((.cse105 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64))) (.cse104 (concat (select .cse56 .cse44) (select .cse56 .cse45))) (.cse100 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse114)) (.cse98 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse99 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse114))) (let ((.cse112 (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (.cse113 (bvadd .cse104 (concat (select .cse98 .cse100) (select .cse98 .cse99)))) (.cse111 (bvmul (_ bv8 32) ((_ extract 31 0) .cse105)))) (let ((.cse38 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse111)) (.cse110 ((_ extract 31 0) .cse113)) (.cse40 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse111)) (.cse109 ((_ extract 63 32) .cse113)) (.cse101 (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse58 (concat (select .cse56 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse112)) (select .cse56 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse112))))) (let ((.cse19 ((_ sign_extend 32) c_~N~0)) (.cse106 (bvadd .cse58 (concat (select .cse98 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse112)) (select .cse98 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse112))))) (.cse102 (bvmul (_ bv8 32) ((_ extract 31 0) .cse101))) (.cse60 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse111)) (.cse59 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse111)) (.cse47 (store (store .cse98 .cse38 .cse110) .cse40 .cse109))) (let ((.cse15 ((_ extract 63 32) (_ bv1 64))) (.cse13 ((_ extract 31 0) (_ bv1 64))) (.cse35 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv20 32))) (.cse70 (let ((.cse107 (bvadd (let ((.cse108 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse108 .cse60) (select .cse108 .cse59))) (concat .cse109 .cse110)))) (store (store .cse47 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse102) ((_ extract 31 0) .cse107)) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32) .cse102) ((_ extract 63 32) .cse107)))) (.cse36 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv16 32))) (.cse42 ((_ extract 31 0) .cse106)) (.cse41 ((_ extract 63 32) .cse106)) (.cse61 (bvslt .cse105 .cse19))) (let ((.cse16 (let ((.cse103 (bvadd .cse104 (_ bv2 64)))) (store (store .cse56 .cse59 ((_ extract 31 0) .cse103)) .cse60 ((_ extract 63 32) .cse103)))) (.cse17 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse102)) (.cse18 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse102)) (.cse20 (bvslt .cse101 .cse19)) (.cse46 (not .cse61)) (.cse37 (store (store .cse98 .cse99 .cse42) .cse100 .cse41)) (.cse22 (= (concat (select .cse70 .cse35) (select .cse70 .cse36)) (_ bv7 64))) (.cse23 (= (concat (select .cse98 .cse35) (select .cse98 .cse36)) (_ bv7 64))) (.cse24 (bvslt (_ bv3 64) .cse19)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv12 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse6 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32))) (.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse32 (concat .cse15 .cse13)) (.cse14 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (.cse21 (not (bvslt (_ bv2 64) .cse19)))) (and (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_255) .cse18 v_ArrVal_254)))) (let ((.cse5 (store (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse10 (bvadd (let ((.cse11 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse11 .cse12) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse9 ((_ extract 63 32) .cse10)) (.cse7 ((_ extract 31 0) .cse10))) (or (= (let ((.cse0 (bvadd (_ bv3 64) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse5 .cse6 .cse7) .cse8 .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse1 .cse2) (select .cse1 .cse3)))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) (_ bv7 64)) (not (= (_ bv3 64) (concat .cse9 .cse7))))))))) (or (bvslt (bvadd (_ bv3 64) |c_ULTIMATE.start_main_~i~0#1|) .cse19) (not .cse20) .cse21 .cse22) (or (bvslt |c_ULTIMATE.start_main_~i~0#1| .cse19) .cse23 .cse21) (or .cse24 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse25 (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_289) .cse18 v_ArrVal_288)))) (let ((.cse30 (store (store (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse31 (bvadd .cse32 (let ((.cse33 (select (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| .cse30) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse33 .cse12) (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse27 ((_ extract 31 0) .cse31)) (.cse26 ((_ extract 63 32) .cse31))) (bvadd (concat .cse26 .cse27) (let ((.cse28 (select (store .cse29 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse30 .cse6 .cse27) .cse8 .cse26)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse28 .cse2) (select .cse28 .cse3)))))))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))))) .cse21) (or .cse20 (= (let ((.cse34 (let ((.cse39 (bvadd (concat .cse41 .cse42) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse43 .cse44) (select .cse43 .cse45)))))) (store (store .cse37 .cse38 ((_ extract 31 0) .cse39)) .cse40 ((_ extract 63 32) .cse39))))) (concat (select .cse34 .cse35) (select .cse34 .cse36))) (_ bv7 64)) .cse46 .cse21) (or (= (_ bv7 64) (concat (select .cse47 .cse35) (select .cse47 .cse36))) .cse20 .cse46 .cse21) (or .cse24 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse48 (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse57 (bvadd .cse58 (_ bv2 64)))) (store (store .cse56 .cse45 ((_ extract 31 0) .cse57)) .cse44 ((_ extract 63 32) .cse57))) .cse59 v_ArrVal_289) .cse60 v_ArrVal_288)))) (let ((.cse53 (store (store (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse54 (bvadd (let ((.cse55 (select (store .cse52 |c_ULTIMATE.start_main_~b~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse32))) (let ((.cse50 ((_ extract 31 0) .cse54)) (.cse49 ((_ extract 63 32) .cse54))) (bvadd (concat .cse49 .cse50) (let ((.cse51 (select (store .cse52 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse53 .cse6 .cse50) .cse8 .cse49)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse51 .cse2) (select .cse51 .cse3)))))))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))))) .cse21) (or .cse61 (= (concat (select .cse37 .cse35) (select .cse37 .cse36)) (_ bv7 64)) .cse21) (forall ((v_ArrVal_255 (_ BitVec 32)) (v_ArrVal_254 (_ BitVec 32))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse56 .cse45 v_ArrVal_255) .cse44 v_ArrVal_254)))) (let ((.cse67 (store (store (select .cse66 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse68 (bvadd (let ((.cse69 (select (store .cse66 |c_ULTIMATE.start_main_~b~0#1.base| .cse67) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse69 .cse12) (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (_ bv1 64)))) (let ((.cse63 ((_ extract 31 0) .cse68)) (.cse62 ((_ extract 63 32) .cse68))) (or (not (= (_ bv3 64) (concat .cse62 .cse63))) (= (let ((.cse64 (bvadd (_ bv3 64) (let ((.cse65 (select (store .cse66 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse67 .cse6 .cse63) .cse8 .cse62)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse65 .cse2) (select .cse65 .cse3)))))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) (_ bv7 64)))))))) (or (not (= (_ bv3 64) (concat (select .cse70 .cse8) (select .cse70 .cse6)))) .cse22) (or .cse61 .cse23 .cse21) (or .cse24 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse71 (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse56 .cse59 v_ArrVal_289) .cse60 v_ArrVal_288)))) (let ((.cse74 (store (store (select .cse73 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse77 (bvadd (let ((.cse78 (select (store .cse73 |c_ULTIMATE.start_main_~b~0#1.base| .cse74) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse78 .cse12) (select .cse78 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse32))) (let ((.cse76 ((_ extract 63 32) .cse77)) (.cse75 ((_ extract 31 0) .cse77))) (bvadd (let ((.cse72 (select (store .cse73 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse74 .cse6 .cse75) .cse8 .cse76)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse72 .cse2) (select .cse72 .cse3))) (concat .cse76 .cse75)))))))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))) (_ bv7 64))) .cse21) (or .cse24 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (_ bv7 64) (let ((.cse79 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse88 ((_ extract 63 32) (_ bv2 64))) (.cse87 ((_ extract 31 0) (_ bv2 64)))) (let ((.cse89 (bvadd (_ bv2 64) (concat .cse88 .cse87)))) (store (store (store (store .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| .cse87) .cse12 .cse88) .cse3 ((_ extract 31 0) .cse89)) .cse2 ((_ extract 63 32) .cse89)))) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_289) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv20 32)) v_ArrVal_288)))) (let ((.cse84 (store (store (select .cse83 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse85 (bvadd .cse32 (let ((.cse86 (select (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| .cse84) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse86 .cse12) (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse81 ((_ extract 31 0) .cse85)) (.cse80 ((_ extract 63 32) .cse85))) (bvadd (concat .cse80 .cse81) (let ((.cse82 (select (store .cse83 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse84 .cse6 .cse81) .cse8 .cse80)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse82 .cse2) (select .cse82 .cse3)))))))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))))) .cse21) (or .cse24 (forall ((v_ArrVal_289 (_ BitVec 32)) (v_ArrVal_288 (_ BitVec 32))) (= (let ((.cse90 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse56 .cse45 v_ArrVal_289) .cse44 v_ArrVal_288)))) (let ((.cse93 (store (store (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| .cse13) .cse14 .cse15))) (let ((.cse96 (bvadd (let ((.cse97 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse93) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse97 .cse12) (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse32))) (let ((.cse95 ((_ extract 63 32) .cse96)) (.cse94 ((_ extract 31 0) .cse96))) (bvadd (let ((.cse91 (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse93 .cse6 .cse94) .cse8 .cse95)) |c_ULTIMATE.start_main_~a~0#1.base|))) (concat (select .cse91 .cse2) (select .cse91 .cse3))) (concat .cse95 .cse94)))))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) (_ bv7 64))) .cse21)))))))))) is different from true [2023-12-02 19:47:39,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:41,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:42,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:45,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:46,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:49,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:51,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:47:53,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:48:47,111 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:48:49,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]