./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:19:47,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:19:47,914 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:19:47,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:19:47,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:19:47,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:19:47,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:19:47,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:19:47,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:19:47,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:19:47,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:19:47,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:19:47,975 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:19:47,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:19:47,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:19:47,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:19:47,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:19:47,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:19:47,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:19:47,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:19:47,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:19:47,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:19:47,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:19:47,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:19:47,982 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:19:47,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:19:47,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:19:47,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:19:47,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:47,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:19:47,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:19:47,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:19:47,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:19:47,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:19:47,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:19:47,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:19:47,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:19:47,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:19:47,990 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:19:47,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/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_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl 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 -> Automizer 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 -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2023-11-12 02:19:48,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:19:48,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:19:48,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:19:48,374 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:19:48,375 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:19:48,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/array-fpi/sina4.c [2023-11-12 02:19:51,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:19:51,754 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:19:51,755 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/sv-benchmarks/c/array-fpi/sina4.c [2023-11-12 02:19:51,763 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/data/71e01f058/e01f824d38ba445d8c4094038f23c5a7/FLAG4e62410af [2023-11-12 02:19:51,777 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/data/71e01f058/e01f824d38ba445d8c4094038f23c5a7 [2023-11-12 02:19:51,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:19:51,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:19:51,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:51,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:19:51,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:19:51,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:51" (1/1) ... [2023-11-12 02:19:51,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a50818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:51, skipping insertion in model container [2023-11-12 02:19:51,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:51" (1/1) ... [2023-11-12 02:19:51,832 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:19:52,058 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_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2023-11-12 02:19:52,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:52,117 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:19:52,135 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_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2023-11-12 02:19:52,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:52,179 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:19:52,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52 WrapperNode [2023-11-12 02:19:52,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:52,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:52,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:19:52,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:19:52,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,229 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2023-11-12 02:19:52,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:52,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:19:52,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:19:52,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:19:52,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:19:52,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:19:52,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:19:52,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:19:52,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (1/1) ... [2023-11-12 02:19:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:19:52,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:19:52,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:19:52,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:19:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:19:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:19:52,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:19:52,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:19:52,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:19:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:19:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:19:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:19:52,466 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:19:52,468 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:19:52,764 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:19:52,772 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:19:52,772 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 02:19:52,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:52 BoogieIcfgContainer [2023-11-12 02:19:52,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:19:52,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:19:52,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:19:52,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:19:52,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:19:51" (1/3) ... [2023-11-12 02:19:52,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5425cc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:52, skipping insertion in model container [2023-11-12 02:19:52,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:52" (2/3) ... [2023-11-12 02:19:52,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5425cc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:52, skipping insertion in model container [2023-11-12 02:19:52,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:52" (3/3) ... [2023-11-12 02:19:52,792 INFO L112 eAbstractionObserver]: Analyzing ICFG sina4.c [2023-11-12 02:19:52,815 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:19:52,815 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:19:52,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:19:52,886 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6901b3f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:19:52,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:19:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 02:19:52,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:52,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:52,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:52,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2023-11-12 02:19:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:52,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901188144] [2023-11-12 02:19:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:53,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901188144] [2023-11-12 02:19:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901188144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:53,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309260423] [2023-11-12 02:19:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:53,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:19:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:53,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:19:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:19:53,147 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-11-12 02:19:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:53,166 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-11-12 02:19:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:19:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-11-12 02:19:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:53,175 INFO L225 Difference]: With dead ends: 50 [2023-11-12 02:19:53,175 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 02:19:53,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:19:53,181 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:53,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 02:19:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 02:19:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-11-12 02:19:53,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2023-11-12 02:19:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:53,216 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-12 02:19:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-11-12 02:19:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-11-12 02:19:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 02:19:53,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:53,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:53,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:19:53,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:53,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2023-11-12 02:19:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047901997] [2023-11-12 02:19:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:53,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047901997] [2023-11-12 02:19:53,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047901997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:53,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:19:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996523711] [2023-11-12 02:19:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:53,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:53,532 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-12 02:19:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:53,660 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-12 02:19:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:19:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-12 02:19:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:53,663 INFO L225 Difference]: With dead ends: 53 [2023-11-12 02:19:53,663 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 02:19:53,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-12 02:19:53,672 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:53,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:19:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 02:19:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-11-12 02:19:53,696 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-11-12 02:19:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-12 02:19:53,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-11-12 02:19:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:53,698 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-12 02:19:53,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-12 02:19:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-12 02:19:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 02:19:53,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:53,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:53,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:19:53,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:53,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2023-11-12 02:19:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512967915] [2023-11-12 02:19:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512967915] [2023-11-12 02:19:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512967915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:19:55,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135111841] [2023-11-12 02:19:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:55,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:19:55,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:19:55,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:19:55,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:19:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:55,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-12 02:19:55,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:55,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-12 02:19:56,014 INFO L351 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-11-12 02:19:56,094 INFO L351 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-11-12 02:19:56,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-12 02:19:56,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-12 02:19:56,764 INFO L322 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-11-12 02:19:56,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 40 [2023-11-12 02:19:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:57,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:19:59,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int)) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2023-11-12 02:19:59,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:19:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-12 02:19:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135111841] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:19:59,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:19:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 39 [2023-11-12 02:19:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361970770] [2023-11-12 02:19:59,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:19:59,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-12 02:19:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-12 02:19:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1215, Unknown=1, NotChecked=72, Total=1482 [2023-11-12 02:19:59,833 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:01,015 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-11-12 02:20:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-12 02:20:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-12 02:20:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:01,018 INFO L225 Difference]: With dead ends: 58 [2023-11-12 02:20:01,018 INFO L226 Difference]: Without dead ends: 56 [2023-11-12 02:20:01,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=300, Invalid=1865, Unknown=1, NotChecked=90, Total=2256 [2023-11-12 02:20:01,020 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:01,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 156 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 538 Invalid, 0 Unknown, 64 Unchecked, 0.6s Time] [2023-11-12 02:20:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-12 02:20:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2023-11-12 02:20:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-11-12 02:20:01,035 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2023-11-12 02:20:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:01,036 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-11-12 02:20:01,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-11-12 02:20:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:20:01,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:01,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:20:01,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 02:20:01,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:01,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:01,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2023-11-12 02:20:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523501006] [2023-11-12 02:20:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523501006] [2023-11-12 02:20:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523501006] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:20:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643668629] [2023-11-12 02:20:01,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:20:01,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:20:01,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:20:01,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:20:01,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:20:01,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:20:01,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:20:01,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:20:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:01,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:20:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643668629] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:20:01,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:20:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-12 02:20:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118829820] [2023-11-12 02:20:01,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:20:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:20:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:20:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:20:01,598 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:01,799 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2023-11-12 02:20:01,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:20:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-12 02:20:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:01,804 INFO L225 Difference]: With dead ends: 110 [2023-11-12 02:20:01,804 INFO L226 Difference]: Without dead ends: 66 [2023-11-12 02:20:01,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:20:01,808 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:01,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 47 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:20:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-12 02:20:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-11-12 02:20:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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-11-12 02:20:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-11-12 02:20:01,839 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2023-11-12 02:20:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:01,840 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-11-12 02:20:01,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-11-12 02:20:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 02:20:01,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:01,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:20:01,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:20:02,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:02,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:02,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2023-11-12 02:20:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737990882] [2023-11-12 02:20:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:02,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737990882] [2023-11-12 02:20:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737990882] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:20:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065397248] [2023-11-12 02:20:02,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:20:02,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:02,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:20:02,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:20:02,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:20:02,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 02:20:02,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:20:02,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:20:02,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:20:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:02,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:20:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065397248] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:20:02,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:20:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-12 02:20:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62570603] [2023-11-12 02:20:02,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:20:02,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:20:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:20:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:20:02,424 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:02,619 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-12 02:20:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:20:02,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-12 02:20:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:02,620 INFO L225 Difference]: With dead ends: 63 [2023-11-12 02:20:02,620 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 02:20:02,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:20:02,621 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:02,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:20:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 02:20:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-11-12 02:20:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-12 02:20:02,630 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-11-12 02:20:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:02,630 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-12 02:20:02,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:20:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-12 02:20:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 02:20:02,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:02,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:20:02,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:20:02,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:02,840 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:02,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2023-11-12 02:20:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738084033] [2023-11-12 02:20:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:20:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738084033] [2023-11-12 02:20:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738084033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:20:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871052055] [2023-11-12 02:20:05,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:20:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:20:05,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:20:05,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb580af0-ceda-4e20-b3cb-01c1f41bf59d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:20:05,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:20:05,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:20:05,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-12 02:20:05,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:20:05,211 INFO L351 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-11-12 02:20:05,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:05,273 INFO L351 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 21 treesize of output 20 [2023-11-12 02:20:05,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:05,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-11-12 02:20:05,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:05,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:05,829 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:20:05,829 INFO L351 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 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-12 02:20:06,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:06,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:06,053 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 02:20:06,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2023-11-12 02:20:06,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:06,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-12 02:20:06,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:06,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-12 02:20:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:07,030 INFO L322 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-11-12 02:20:07,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 50 [2023-11-12 02:20:07,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:07,509 INFO L322 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2023-11-12 02:20:07,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 103 [2023-11-12 02:20:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:20:09,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:20:12,207 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (+ c_~N~0 2) (select (let ((.cse0 (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) (.cse1 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) is different from false [2023-11-12 02:20:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 02:20:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871052055] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:20:17,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:20:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2023-11-12 02:20:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558593578] [2023-11-12 02:20:17,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:20:17,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-12 02:20:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-12 02:20:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=3870, Unknown=1, NotChecked=128, Total=4422 [2023-11-12 02:20:17,253 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 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-11-12 02:20:27,986 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse32 (select .cse12 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse32)))) (.cse20 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (+ .cse4 .cse20)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse0 (+ c_~N~0 2)) (.cse14 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse6 (select .cse12 .cse13))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse5 .cse6)))) (store .cse8 .cse9 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse10 .cse9))))))) (let ((.cse1 (store (select .cse3 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse5 .cse6 1))) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse3 |ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) .cse14) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse24)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse18 .cse20))))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse18 .cse19 .cse20)))) (store .cse22 .cse9 (+ (select .cse23 .cse9) (select (select (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse15 (store (select .cse17 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse18 .cse19 .cse20 1))) (.cse16 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse15 (+ .cse16 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse17 |ULTIMATE.start_main_~b~0#1.base| .cse15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (not (= c_~N~0 2))) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse24))) (store .cse28 .cse9 (+ (select .cse12 .cse9) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse25 (store (select .cse27 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse20 1))) (.cse26 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse25 (+ .cse26 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse27 |ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse33 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse32 .cse33)))) (store .cse35 .cse9 (+ (select .cse36 .cse9) (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse29 (store (select .cse31 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse32 .cse33 1))) (.cse30 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse29 (+ .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse31 |ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse41 (select .cse36 .cse13))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse32 .cse41))))) (let ((.cse44 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse40 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse39 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse32 .cse40 .cse41)))) (store .cse43 .cse9 (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse44 .cse9))))))) (let ((.cse37 (store (select .cse39 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse32 .cse40 1 .cse41))) (.cse38 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse37 (+ .cse38 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse39 |ULTIMATE.start_main_~b~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0))) .cse14)))))) is different from true [2023-11-12 02:20:30,571 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse51 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse80 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select .cse8 .cse80))) (let ((.cse75 (+ .cse4 .cse69))) (let ((.cse64 (+ .cse51 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (store .cse8 .cse80 .cse75)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse9 (+ .cse4 .cse5)) (.cse23 (= c_~N~0 2)) (.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse38 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) (.cse0 (+ c_~N~0 2)) (.cse65 (select .cse8 .cse64))) (and (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (store .cse6 .cse7 (+ (select .cse8 .cse7) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse1 (store (select .cse3 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse5 1))) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse3 |ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse7 1)))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse20 (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse5)))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse14 .cse15 .cse5 .cse16)))) (store .cse18 .cse7 (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse19 .cse7)))))))) (let ((.cse11 (store (select .cse13 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse14 .cse15 .cse5 1 .cse16))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse11 (+ .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse13 |ULTIMATE.start_main_~b~0#1.base| .cse11) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) 4)))) (= (select .cse8 0) 3) .cse23 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse24 (store (select .cse26 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse25 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse24 (+ .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse26 |ULTIMATE.start_main_~b~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse32 (select .cse8 .cse37))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse32))))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse31 .cse32)))) (store .cse34 .cse7 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse7))))))) (let ((.cse28 (store (select .cse30 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse31 .cse32 1))) (.cse29 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse28 (+ .cse29 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse30 |ULTIMATE.start_main_~b~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) .cse38) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse7 1)))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse48 (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 1)))) (let ((.cse47 (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48))) (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 .cse44 1)))) (store .cse46 .cse7 (+ (select .cse47 .cse7) (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (let ((.cse39 (store (select .cse41 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse42 .cse43 .cse44 2))) (.cse40 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse39 (+ .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse41 |ULTIMATE.start_main_~b~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= 3 (select .cse8 8)) (or (= (select (store .cse8 .cse51 (+ .cse4 (select .cse8 .cse51))) 0) (+ c_~N~0 1)) (and (or (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (<= 2 c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse55 .cse5))))) (let ((.cse59 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse58 (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse55 .cse56 .cse5)))) (store .cse58 .cse7 (+ (select .cse59 .cse7) (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse52 (store (select .cse54 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse55 .cse56 .cse5 1))) (.cse53 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse52 (+ .cse53 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse54 |ULTIMATE.start_main_~b~0#1.base| .cse52) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (not .cse23) (< |c_ULTIMATE.start_main_~i~0#1| 2)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|))) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse63 (store .cse27 .cse64 (+ .cse65 (select (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse63))) (let ((.cse60 (store (select .cse62 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse61 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse60 (+ .cse61 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse62 |ULTIMATE.start_main_~b~0#1.base| .cse60) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse75)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse37))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse69 .cse71))))) (let ((.cse74 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse70 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse68 (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse69 .cse70 .cse71)))) (store .cse73 .cse7 (+ (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse74 .cse7))))))) (let ((.cse66 (store (select .cse68 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse69 .cse70 1 .cse71))) (.cse67 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse66 (+ .cse67 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse68 |ULTIMATE.start_main_~b~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0))) .cse38) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse79 (store .cse8 .cse64 (+ .cse4 .cse65)))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse79))) (let ((.cse76 (store (select .cse78 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse77 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse76 (+ .cse77 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse78 |ULTIMATE.start_main_~b~0#1.base| .cse76) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) is different from true [2023-11-12 02:20:35,588 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse74 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse72 (+ .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse42 (select .cse2 .cse72))) (let ((.cse73 (+ .cse11 .cse42))) (let ((.cse37 (+ .cse74 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse73))) (.cse16 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (store .cse2 .cse72 .cse73))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7)) (.cse1 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 .cse16 1)))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse64 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse62 (select (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse69 (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63 .cse64)))) (let ((.cse68 (select (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse69) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse65 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse69))) (store .cse66 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse67 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse62 .cse63 .cse64 .cse65)))) (store .cse67 .cse16 (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~a~0#1.base| .cse67) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 .cse16)))))))) (let ((.cse59 (store (select .cse61 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse62 .cse63 .cse64 1 .cse65))) (.cse60 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse59 (+ .cse60 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse61 |ULTIMATE.start_main_~b~0#1.base| .cse59) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) 4)))) (.cse46 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse20 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) (.cse3 (+ c_~N~0 2)) (.cse38 (select .cse2 .cse37))) (and (or .cse0 .cse1) (= (select .cse2 0) 3) (= c_~N~0 2) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse3 (select (let ((.cse4 (store (select .cse6 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse4 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse6 |ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse3 (select (let ((.cse13 (select .cse2 .cse19))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))))) (let ((.cse17 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse11 .cse12 .cse13)))) (store .cse15 .cse16 (+ (select (select (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse17 .cse16))))))) (let ((.cse8 (store (select .cse10 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse11 .cse12 .cse13 1))) (.cse9 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse8 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse10 |ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) .cse20) (or .cse0 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse16 1)))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse24 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 1)))) (let ((.cse29 (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse30) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse30))) (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse24 .cse25 .cse26 1)))) (store .cse28 .cse16 (+ (select .cse29 .cse16) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (let ((.cse21 (store (select .cse23 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse24 .cse25 .cse26 2))) (.cse22 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse21 (+ .cse22 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse23 |ULTIMATE.start_main_~b~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= 3 (select .cse2 8)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|))) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse3 (select (let ((.cse36 (store .cse7 .cse37 (+ .cse38 (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36))) (let ((.cse33 (store (select .cse35 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse34 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse33 (+ .cse34 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse35 |ULTIMATE.start_main_~b~0#1.base| .cse33) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (or .cse1 (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (not (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse3 (select (let ((.cse43 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse11 .cse42 .cse43)))) (store .cse45 .cse16 (+ (select .cse46 .cse16) (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse39 (store (select .cse41 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse11 .cse42 .cse43 1))) (.cse40 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse39 (+ .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse41 |ULTIMATE.start_main_~b~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse51 (select .cse46 .cse19))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse42 .cse51))))) (let ((.cse54 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse50 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse49 (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse53 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse11 .cse42 .cse50 .cse51)))) (store .cse53 .cse16 (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse54 .cse16))))))) (let ((.cse47 (store (select .cse49 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse11 .cse42 .cse50 1 .cse51))) (.cse48 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse47 (+ .cse48 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse49 |ULTIMATE.start_main_~b~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))) .cse20) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse3 (select (let ((.cse58 (store .cse2 .cse37 (+ .cse11 .cse38)))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse58))) (let ((.cse55 (store (select .cse57 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse56 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse55 (+ .cse56 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse57 |ULTIMATE.start_main_~b~0#1.base| .cse55) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) is different from true