./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/indp5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:02:25,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:02:25,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:02:25,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:02:25,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:02:25,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:02:25,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:02:25,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:02:25,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:02:25,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:02:25,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:02:25,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:02:25,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:02:25,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:02:25,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:02:25,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:02:25,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:02:25,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:02:25,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:02:25,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:02:25,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:02:25,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:02:25,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:02:25,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:02:25,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:02:25,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:02:25,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:02:25,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:02:25,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:02:25,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:02:25,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:02:25,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:02:25,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:02:25,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:02:25,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:02:25,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:02:25,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:02:25,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:02:25,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:02:25,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:02:25,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:02:25,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:02:25,896 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:02:25,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:02:25,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:02:25,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:02:25,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:02:25,898 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:02:25,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:02:25,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:02:25,899 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:02:25,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:02:25,900 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:02:25,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:02:25,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:02:25,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:02:25,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:02:25,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:02:25,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:02:25,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:02:25,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:02:25,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:02:25,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:02:25,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:02:25,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:02:25,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:02:25,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:02:25,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:02:25,903 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:02:25,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:02:25,903 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:02:25,904 INFO L138 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b [2023-02-15 19:02:26,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:02:26,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:02:26,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:02:26,151 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:02:26,152 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:02:26,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp5.c [2023-02-15 19:02:27,126 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:02:27,290 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:02:27,291 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c [2023-02-15 19:02:27,296 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cd6e319/15ca777eba324c2cb7fb350b87b43a71/FLAG687856b7f [2023-02-15 19:02:27,310 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cd6e319/15ca777eba324c2cb7fb350b87b43a71 [2023-02-15 19:02:27,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:02:27,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:02:27,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:02:27,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:02:27,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:02:27,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c01b578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27, skipping insertion in model container [2023-02-15 19:02:27,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:02:27,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:02:27,470 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c[588,601] [2023-02-15 19:02:27,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:02:27,512 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:02:27,525 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c[588,601] [2023-02-15 19:02:27,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:02:27,557 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:02:27,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27 WrapperNode [2023-02-15 19:02:27,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:02:27,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:02:27,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:02:27,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:02:27,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,587 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-02-15 19:02:27,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:02:27,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:02:27,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:02:27,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:02:27,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,631 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:02:27,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:02:27,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:02:27,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:02:27,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (1/1) ... [2023-02-15 19:02:27,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:02:27,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:02:27,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:02:27,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:02:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:02:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:02:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:02:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:02:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:02:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:02:27,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:02:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:02:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:02:27,795 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:02:27,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:02:28,011 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:02:28,015 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:02:28,015 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 19:02:28,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:02:28 BoogieIcfgContainer [2023-02-15 19:02:28,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:02:28,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:02:28,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:02:28,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:02:28,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:02:27" (1/3) ... [2023-02-15 19:02:28,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dafc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:02:28, skipping insertion in model container [2023-02-15 19:02:28,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:02:27" (2/3) ... [2023-02-15 19:02:28,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dafc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:02:28, skipping insertion in model container [2023-02-15 19:02:28,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:02:28" (3/3) ... [2023-02-15 19:02:28,022 INFO L112 eAbstractionObserver]: Analyzing ICFG indp5.c [2023-02-15 19:02:28,033 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:02:28,033 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:02:28,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:02:28,064 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1553fe0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:02:28,064 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:02:28,066 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-02-15 19:02:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:02:28,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:02:28,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:02:28,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:02:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:02:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2023-02-15 19:02:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:02:28,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971177107] [2023-02-15 19:02:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:02:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:02:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:02:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:02:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:02:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971177107] [2023-02-15 19:02:28,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971177107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:02:28,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:02:28,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:02:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239594986] [2023-02-15 19:02:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:02:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:02:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:02:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:02:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:02:28,228 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.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:02:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:02:28,240 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-15 19:02:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:02:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 19:02:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:02:28,247 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:02:28,247 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 19:02:28,250 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-02-15 19:02:28,252 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-02-15 19:02:28,253 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-02-15 19:02:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 19:02:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 19:02:28,278 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-02-15 19:02:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 19:02:28,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2023-02-15 19:02:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:02:28,281 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 19:02:28,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:02:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 19:02:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:02:28,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:02:28,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:02:28,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:02:28,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:02:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:02:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2023-02-15 19:02:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:02:28,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613055646] [2023-02-15 19:02:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:02:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:02:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:02:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:02:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:02:28,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613055646] [2023-02-15 19:02:28,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613055646] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:02:28,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:02:28,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:02:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005837093] [2023-02-15 19:02:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:02:28,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:02:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:02:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:02:28,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:02:28,432 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:02:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:02:28,508 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-02-15 19:02:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:02:28,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 19:02:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:02:28,510 INFO L225 Difference]: With dead ends: 49 [2023-02-15 19:02:28,510 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 19:02:28,510 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-02-15 19:02:28,512 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:02:28,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:02:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 19:02:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-02-15 19:02:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-15 19:02:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-15 19:02:28,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2023-02-15 19:02:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:02:28,527 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-15 19:02:28,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:02:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-15 19:02:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:02:28,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:02:28,529 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, 1, 1, 1] [2023-02-15 19:02:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:02:28,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:02:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:02:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2023-02-15 19:02:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:02:28,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411085478] [2023-02-15 19:02:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:02:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:02:28,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:02:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233413235] [2023-02-15 19:02:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:02:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:02:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:02:28,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:02:28,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:02:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:02:28,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 19:02:28,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:02:28,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:02:28,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 19:02:28,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2023-02-15 19:02:28,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:02:28,796 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:02:28,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-02-15 19:02:28,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-02-15 19:02:29,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-02-15 19:02:29,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 19:02:29,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-02-15 19:02:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:02:29,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:02:43,039 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:02:43,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:02:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:02:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:02:43,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411085478] [2023-02-15 19:02:43,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:02:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233413235] [2023-02-15 19:02:43,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233413235] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:02:43,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:02:43,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2023-02-15 19:02:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183663003] [2023-02-15 19:02:43,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:02:43,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 19:02:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:02:43,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 19:02:43,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=272, Unknown=2, NotChecked=0, Total=342 [2023-02-15 19:02:43,084 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:03:03,539 WARN L233 SmtUtils]: Spent 19.46s on a formula simplification. DAG size of input: 99 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:03:05,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:03:14,431 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:03:16,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:03:21,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:03:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:03:22,527 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-02-15 19:03:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:03:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 19:03:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:03:22,529 INFO L225 Difference]: With dead ends: 79 [2023-02-15 19:03:22,529 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 19:03:22,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=187, Invalid=741, Unknown=2, NotChecked=0, Total=930 [2023-02-15 19:03:22,530 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 89 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:03:22,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 283 Invalid, 3 Unknown, 0 Unchecked, 8.6s Time] [2023-02-15 19:03:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 19:03:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2023-02-15 19:03:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 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-02-15 19:03:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2023-02-15 19:03:22,546 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 27 [2023-02-15 19:03:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:03:22,546 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2023-02-15 19:03:22,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:03:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2023-02-15 19:03:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 19:03:22,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:03:22,547 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, 1, 1, 1] [2023-02-15 19:03:22,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:03:22,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:03:22,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:03:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:03:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2023-02-15 19:03:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:03:22,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72058058] [2023-02-15 19:03:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:03:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:03:22,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:03:22,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190639313] [2023-02-15 19:03:22,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:03:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:03:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:03:22,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:03:22,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:03:22,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:03:22,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:03:22,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:03:22,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:03:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:03:23,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:03:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:03:23,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:03:23,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72058058] [2023-02-15 19:03:23,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:03:23,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190639313] [2023-02-15 19:03:23,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190639313] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:03:23,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:03:23,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 19:03:23,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256685673] [2023-02-15 19:03:23,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:03:23,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:03:23,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:03:23,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:03:23,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:03:23,280 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-15 19:03:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:03:23,828 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2023-02-15 19:03:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:03:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 19:03:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:03:23,833 INFO L225 Difference]: With dead ends: 126 [2023-02-15 19:03:23,833 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 19:03:23,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:03:23,834 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:03:23,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 32 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:03:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 19:03:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2023-02-15 19:03:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 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-02-15 19:03:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-02-15 19:03:23,840 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2023-02-15 19:03:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:03:23,840 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-02-15 19:03:23,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-15 19:03:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-02-15 19:03:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 19:03:23,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:03:23,845 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, 1, 1, 1] [2023-02-15 19:03:23,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 19:03:24,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 19:03:24,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:03:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:03:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2023-02-15 19:03:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:03:24,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034406316] [2023-02-15 19:03:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:03:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:03:24,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:03:24,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428694780] [2023-02-15 19:03:24,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:03:24,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:03:24,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:03:24,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:03:24,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:03:24,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 19:03:24,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:03:24,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:03:24,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:03:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:03:24,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:03:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:03:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:03:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034406316] [2023-02-15 19:03:24,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:03:24,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428694780] [2023-02-15 19:03:24,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428694780] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:03:24,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:03:24,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 19:03:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196072543] [2023-02-15 19:03:24,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:03:24,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:03:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:03:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:03:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:03:24,574 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-15 19:03:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:03:25,090 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-02-15 19:03:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:03:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 19:03:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:03:25,095 INFO L225 Difference]: With dead ends: 58 [2023-02-15 19:03:25,095 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 19:03:25,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:03:25,098 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:03:25,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 26 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:03:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 19:03:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-02-15 19:03:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:03:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-02-15 19:03:25,109 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2023-02-15 19:03:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:03:25,110 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-02-15 19:03:25,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-15 19:03:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-02-15 19:03:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:03:25,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:03:25,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:03:25,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:03:25,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:03:25,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:03:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:03:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2023-02-15 19:03:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:03:25,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416876088] [2023-02-15 19:03:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:03:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:03:25,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:03:25,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331714315] [2023-02-15 19:03:25,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:03:25,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:03:25,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:03:25,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:03:25,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:03:25,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:03:25,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:03:25,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-15 19:03:25,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:03:25,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 19:03:25,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:03:25,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2023-02-15 19:03:25,673 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:03:25,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:03:25,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:03:26,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2023-02-15 19:03:26,335 INFO L321 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2023-02-15 19:03:26,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 101 treesize of output 156 [2023-02-15 19:03:26,343 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:03:26,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:03:26,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-02-15 19:03:27,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2023-02-15 19:03:27,087 INFO L321 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2023-02-15 19:03:27,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 152 [2023-02-15 19:03:27,139 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:03:27,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:03:27,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-02-15 19:03:27,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2023-02-15 19:03:27,855 INFO L321 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2023-02-15 19:03:27,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 152 [2023-02-15 19:03:27,863 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:03:28,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:03:28,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-02-15 19:03:28,475 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 19:03:28,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 84 [2023-02-15 19:03:28,843 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 19:03:28,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 84 [2023-02-15 19:03:29,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:03:29,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2023-02-15 19:03:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:03:29,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:04:12,037 WARN L233 SmtUtils]: Spent 9.79s on a formula simplification that was a NOOP. DAG size: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:05:41,149 WARN L233 SmtUtils]: Spent 41.47s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:05:41,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:05:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:05:41,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:05:41,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416876088] [2023-02-15 19:05:41,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:05:41,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331714315] [2023-02-15 19:05:41,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331714315] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:05:41,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:05:41,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 46 [2023-02-15 19:05:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306680386] [2023-02-15 19:05:41,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:05:41,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 19:05:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:05:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 19:05:41,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1830, Unknown=14, NotChecked=0, Total=2070 [2023-02-15 19:05:41,195 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 46 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:05:49,152 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse64 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse67 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse66 (mod .cse64 4294967296))) (let ((.cse37 (<= .cse66 2147483647)) (.cse12 (<= .cse67 2147483647)) (.cse65 (* |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse10 (* .cse67 8)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) .cse65 1)) (.cse2 (not .cse12)) (.cse19 (not (< .cse64 c_~N~0))) (.cse27 (* .cse66 8)) (.cse28 (+ (* .cse64 .cse64) .cse65 3)) (.cse29 (not .cse37)) (.cse1 (< 2 c_~N~0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< 1 c_~N~0) (<= c_~N~0 2147483647) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse1 (and (or .cse2 (= (let ((.cse8 (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (select .cse8 .cse7))) (store (store (store (store (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) .cse7 (+ .cse9 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) .cse7 (+ .cse9 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) .cse7 (+ .cse9 (- 3))))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6)))))) c_~N~0)) (or .cse12 (= (let ((.cse17 (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (select .cse17 .cse7))) (store (store (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse7 (+ .cse18 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse7 (+ .cse18 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse7 (+ .cse18 (- 3))))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse16)))))) c_~N~0)))) (or .cse19 .cse1 (and (or .cse12 (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse25 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse28))) (let ((.cse22 (select .cse25 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse26 (select .cse25 .cse24))) (store (store (store (store (store (store .cse25 |ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse24 (+ .cse26 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse24 (+ .cse26 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse24 (+ .cse26 (- 3))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) .cse22 .cse23)))))) c_~N~0)) .cse29) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse35 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27 (- 34359738368)) .cse28))) (let ((.cse33 (select .cse35 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (select .cse35 .cse34))) (store (store (store (store (store (store .cse35 |ULTIMATE.start_main_~a~0#1.offset| .cse33) .cse34 (+ .cse36 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse33) .cse34 (+ .cse36 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse33) .cse34 (+ .cse36 (- 3))))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse34) .cse32 .cse33)))))) c_~N~0)) .cse37))) (or (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse43 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse28))) (let ((.cse40 (select .cse43 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse44 (select .cse43 .cse42))) (store (store (store (store (store (store .cse43 |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse42 (+ .cse44 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse42 (+ .cse44 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse42 (+ .cse44 (- 3))))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse42) .cse40 .cse41)))))) c_~N~0)) .cse29) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse50 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27 (- 34359738368)) .cse28))) (let ((.cse46 (select .cse50 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (select .cse50 .cse49))) (store (store (store (store (store (store .cse50 |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse49 (+ .cse51 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse49 (+ .cse51 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse49 (+ .cse51 (- 3))))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse45 .cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse49))))))) c_~N~0)) .cse37)) .cse2))) (or .cse19 (and (or .cse37 (= (let ((.cse56 (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27 (- 34359738368)) .cse28))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse57 (select .cse56 .cse7))) (store (store (store (store (store (store .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse7 (+ .cse57 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse7 (+ .cse57 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse7 (+ .cse57 (- 3))))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse54 .cse55)))))) c_~N~0)) (or (= (let ((.cse62 (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse28))) (let ((.cse58 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse63 (select .cse62 .cse7))) (store (store (store (store (store (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) .cse7 (+ .cse63 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) .cse7 (+ .cse63 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) .cse7 (+ .cse63 (- 3))))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse61)))))) c_~N~0) .cse29)) .cse1) (= (select .cse0 .cse7) 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) is different from true [2023-02-15 19:05:56,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:05,152 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse69 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse72 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse71 (mod .cse69 4294967296))) (let ((.cse42 (<= .cse71 2147483647)) (.cse17 (<= .cse72 2147483647)) (.cse70 (* |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse15 (* .cse72 8)) (.cse16 (+ (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) .cse70 1)) (.cse8 (not .cse17)) (.cse24 (not (< .cse69 c_~N~0))) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse32 (* .cse71 8)) (.cse33 (+ (* .cse69 .cse69) .cse70 3)) (.cse34 (not .cse42)) (.cse0 (< 2 c_~N~0))) (and (or .cse0 (= (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) .cse5 (+ .cse7 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) .cse5 (+ .cse7 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) .cse5 (+ .cse7 (- 3))))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4))))) c_~N~0)) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse0 (and (or .cse8 (= (let ((.cse13 (store .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse15) .cse16))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (select .cse13 .cse5))) (store (store (store (store (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) .cse5 (+ .cse14 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) .cse5 (+ .cse14 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) .cse5 (+ .cse14 (- 3))))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse11 .cse12)))))) c_~N~0)) (or .cse17 (= (let ((.cse22 (store .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse15 (- 34359738368)) .cse16))) (let ((.cse18 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (select .cse22 .cse5))) (store (store (store (store (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) .cse5 (+ .cse23 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) .cse5 (+ .cse23 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) .cse5 (+ .cse23 (- 3))))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse21)))))) c_~N~0)))) (or .cse24 .cse0 (and (or .cse17 (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse30 (store (store .cse6 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse15 (- 34359738368)) .cse16) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33))) (let ((.cse27 (select .cse30 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse31 (select .cse30 .cse29))) (store (store (store (store (store (store .cse30 |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse29 (+ .cse31 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse29 (+ .cse31 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse29 (+ .cse31 (- 3))))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse29) .cse27 .cse28)))))) c_~N~0)) .cse34) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse40 (store (store .cse6 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse15 (- 34359738368)) .cse16) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse32 (- 34359738368)) .cse33))) (let ((.cse38 (select .cse40 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse41 (select .cse40 .cse39))) (store (store (store (store (store (store .cse40 |ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse39 (+ .cse41 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse39 (+ .cse41 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse39 (+ .cse41 (- 3))))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39) .cse37 .cse38)))))) c_~N~0)) .cse42))) (or (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse48 (store (store .cse6 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse15) .cse16) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33))) (let ((.cse45 (select .cse48 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (select .cse48 .cse47))) (store (store (store (store (store (store .cse48 |ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse47 (+ .cse49 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse47 (+ .cse49 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse47 (+ .cse49 (- 3))))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse47) .cse45 .cse46)))))) c_~N~0)) .cse34) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse55 (store (store .cse6 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse15) .cse16) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse32 (- 34359738368)) .cse33))) (let ((.cse51 (select .cse55 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse55 .cse54))) (store (store (store (store (store (store .cse55 |ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse54 (+ .cse56 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse54 (+ .cse56 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse54 (+ .cse56 (- 3))))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse50 .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse54))))))) c_~N~0)) .cse42)) .cse8))) (or .cse24 (and (or .cse42 (= (let ((.cse61 (store .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse32 (- 34359738368)) .cse33))) (let ((.cse59 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (select .cse61 .cse5))) (store (store (store (store (store (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse5 (+ .cse62 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse5 (+ .cse62 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse5 (+ .cse62 (- 3))))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse59 .cse60)))))) c_~N~0)) (or (= (let ((.cse67 (store .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33))) (let ((.cse63 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse68 (select .cse67 .cse5))) (store (store (store (store (store (store .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse5 (+ .cse68 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse5 (+ .cse68 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse5 (+ .cse68 (- 3))))))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse66)))))) c_~N~0) .cse34)) .cse0)))))) is different from true [2023-02-15 19:06:07,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:10,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-15 19:06:22,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:24,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:33,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-15 19:06:36,300 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse120 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse117 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse121 (mod .cse117 4294967296)) (.cse40 (* .cse120 8))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)) (.cse51 (<= .cse121 2147483647)) (.cse41 (* .cse121 8)) (.cse2 (<= .cse120 2147483647)) (.cse118 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse40 (- 34359738368))) (.cse119 (* |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse24 (+ (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) .cse119 1)) (.cse32 (not (< .cse117 c_~N~0))) (.cse42 (+ (* .cse117 .cse117) .cse119 3)) (.cse16 (< 2 c_~N~0)) (.cse7 (store .cse0 .cse31 (+ .cse118 (select .cse0 .cse31)))) (.cse15 (not .cse2)) (.cse79 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse41)) (.cse43 (not .cse51)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse13 (store .cse0 .cse23 (+ (select .cse0 .cse23) .cse118))) (.cse72 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse41 (- 34359738368))) (.cse86 (* (- 1) .cse117 .cse117))) (and (= (select .cse0 .cse1) 3) (or (and (or .cse2 (= (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (select .cse7 .cse1))) (store (store (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse1 (+ .cse8 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse1 (+ .cse8 (- 2))))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse6))))) c_~N~0)) (or (= (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (select .cse13 .cse1))) (store (store (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse1 (+ .cse14 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse1 (+ .cse14 (- 2))))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse12))))) c_~N~0) .cse15)) .cse16) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< 1 c_~N~0) (<= c_~N~0 2147483647) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse16 (and (or .cse15 (= (let ((.cse21 (store .cse0 .cse23 .cse24))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (select .cse21 .cse1))) (store (store (store (store (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse19) .cse1 (+ .cse22 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse19) .cse1 (+ .cse22 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse19) .cse1 (+ .cse22 (- 3))))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse19 .cse20)))))) c_~N~0)) (or .cse2 (= (let ((.cse29 (store .cse0 .cse31 .cse24))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (select .cse29 .cse1))) (store (store (store (store (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse1 (+ .cse30 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse1 (+ .cse30 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse1 (+ .cse30 (- 3))))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse28)))))) c_~N~0)))) (or .cse32 .cse16 (and (or .cse2 (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse38 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse40 (- 34359738368)) .cse24) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse41) .cse42))) (let ((.cse35 (select .cse38 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse39 (select .cse38 .cse37))) (store (store (store (store (store (store .cse38 |ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse37 (+ .cse39 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse37 (+ .cse39 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse37 (+ .cse39 (- 3))))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse37) .cse35 .cse36)))))) c_~N~0)) .cse43) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse49 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse40 (- 34359738368)) .cse24) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse41 (- 34359738368)) .cse42))) (let ((.cse47 (select .cse49 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (select .cse49 .cse48))) (store (store (store (store (store (store .cse49 |ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse48 (+ .cse50 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse48 (+ .cse50 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse48 (+ .cse50 (- 3))))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48) .cse46 .cse47)))))) c_~N~0)) .cse51))) (or (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse57 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse24) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse41) .cse42))) (let ((.cse54 (select .cse57 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse58 (select .cse57 .cse56))) (store (store (store (store (store (store .cse57 |ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse56 (+ .cse58 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse56 (+ .cse58 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse56 (+ .cse58 (- 3))))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56) .cse54 .cse55)))))) c_~N~0)) .cse43) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse64 (store (store .cse0 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse24) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse41 (- 34359738368)) .cse42))) (let ((.cse60 (select .cse64 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse65 (select .cse64 .cse63))) (store (store (store (store (store (store .cse64 |ULTIMATE.start_main_~a~0#1.offset| .cse60) .cse63 (+ .cse65 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse60) .cse63 (+ .cse65 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse60) .cse63 (+ .cse65 (- 3))))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse59 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse59 .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse60))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))))))) c_~N~0)) .cse51)) .cse15))) (or .cse32 (and (or .cse51 (= (let ((.cse70 (store .cse0 .cse72 .cse42))) (let ((.cse68 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse71 (select .cse70 .cse1))) (store (store (store (store (store (store .cse70 |c_ULTIMATE.start_main_~a~0#1.offset| .cse68) .cse1 (+ .cse71 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse68) .cse1 (+ .cse71 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse68) .cse1 (+ .cse71 (- 3))))))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse68 .cse69)))))) c_~N~0)) (or (= (let ((.cse77 (store .cse0 .cse79 .cse42))) (let ((.cse73 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse78 (select .cse77 .cse1))) (store (store (store (store (store (store .cse77 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73) .cse1 (+ .cse78 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse73) .cse1 (+ .cse78 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse73) .cse1 (+ .cse78 (- 3))))))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse76))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse76)))))) c_~N~0) .cse43)) .cse16) (or .cse16 (and (or (= (let ((.cse84 (store .cse0 .cse72 (+ (select .cse0 .cse72) .cse86)))) (let ((.cse80 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse85 (select .cse84 .cse1))) (store (store (store (store .cse84 |c_ULTIMATE.start_main_~a~0#1.offset| .cse80) .cse1 (+ .cse85 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse80) .cse1 (+ .cse85 (- 2))))))) (let ((.cse82 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse80 (select (select (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse83)))))) c_~N~0) .cse51) (or (= (let ((.cse91 (store .cse0 .cse79 (+ (select .cse0 .cse79) .cse86)))) (let ((.cse87 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse92 (select .cse91 .cse1))) (store (store (store (store .cse91 |c_ULTIMATE.start_main_~a~0#1.offset| .cse87) .cse1 (+ .cse92 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse87) .cse1 (+ .cse92 (- 2))))))) (let ((.cse89 (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse87 (select (select (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse90)))))) c_~N~0) .cse43))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (or .cse16 (and (or .cse2 (and (or (= (let ((.cse97 (store .cse7 .cse79 (+ (select .cse7 .cse79) .cse86)))) (let ((.cse95 (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse98 (select .cse97 .cse1))) (store (store (store (store .cse97 |c_ULTIMATE.start_main_~a~0#1.offset| .cse95) .cse1 (+ .cse98 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse95) .cse1 (+ .cse98 (- 2))))))) (let ((.cse94 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse96 (select .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse94 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse96))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse95 .cse96)))))) c_~N~0) .cse43) (or (= (let ((.cse103 (store .cse7 .cse72 (+ (select .cse7 .cse72) .cse86)))) (let ((.cse100 (select .cse103 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse101 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse104 (select .cse103 .cse1))) (store (store (store (store .cse103 |c_ULTIMATE.start_main_~a~0#1.offset| .cse100) .cse1 (+ .cse104 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse100) .cse1 (+ .cse104 (- 2))))))) (let ((.cse102 (select .cse101 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse99 (select .cse102 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse99 .cse100 (select (select (store .cse101 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse102 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse99 .cse100))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) c_~N~0) .cse51))) (or .cse15 (and (or (= (let ((.cse109 (store .cse13 .cse79 (+ (select .cse13 .cse79) .cse86)))) (let ((.cse105 (select .cse109 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse106 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse110 (select .cse109 .cse1))) (store (store (store (store .cse109 |c_ULTIMATE.start_main_~a~0#1.offset| .cse105) .cse1 (+ .cse110 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse105) .cse1 (+ .cse110 (- 2))))))) (let ((.cse107 (select .cse106 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse108 (select .cse107 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse105 (select (select (store .cse106 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse107 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse105 .cse108))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse108)))))) c_~N~0) .cse43) (or .cse51 (= (let ((.cse115 (store .cse13 .cse72 (+ (select .cse13 .cse72) .cse86)))) (let ((.cse113 (select .cse115 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse116 (select .cse115 .cse1))) (store (store (store (store .cse115 |c_ULTIMATE.start_main_~a~0#1.offset| .cse113) .cse1 (+ .cse116 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse113) .cse1 (+ .cse116 (- 2))))))) (let ((.cse112 (select .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse114 (select .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse113 .cse114)))))) c_~N~0))))))))))) is different from true [2023-02-15 19:06:38,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:40,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:50,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:06:56,881 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse64 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse67 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse66 (mod .cse64 4294967296))) (let ((.cse37 (<= .cse66 2147483647)) (.cse12 (<= .cse67 2147483647)) (.cse65 (* |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse10 (* .cse67 8)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) .cse65 1)) (.cse1 (not .cse12)) (.cse19 (not (< .cse64 c_~N~0))) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (* .cse66 8)) (.cse28 (+ (* .cse64 .cse64) .cse65 3)) (.cse29 (not .cse37)) (.cse0 (< 2 c_~N~0))) (and (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse0 (and (or .cse1 (= (let ((.cse7 (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (select .cse7 .cse6))) (store (store (store (store (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) .cse6 (+ .cse8 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) .cse6 (+ .cse8 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse4) .cse6 (+ .cse8 (- 3))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) c_~N~0)) (or .cse12 (= (let ((.cse17 (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (select .cse17 .cse6))) (store (store (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse6 (+ .cse18 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse6 (+ .cse18 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse6 (+ .cse18 (- 3))))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse16)))))) c_~N~0)))) (or .cse19 .cse0 (and (or .cse12 (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse25 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse28))) (let ((.cse22 (select .cse25 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse26 (select .cse25 .cse24))) (store (store (store (store (store (store .cse25 |ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse24 (+ .cse26 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse24 (+ .cse26 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse24 (+ .cse26 (- 3))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) .cse22 .cse23)))))) c_~N~0)) .cse29) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse35 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27 (- 34359738368)) .cse28))) (let ((.cse33 (select .cse35 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (select .cse35 .cse34))) (store (store (store (store (store (store .cse35 |ULTIMATE.start_main_~a~0#1.offset| .cse33) .cse34 (+ .cse36 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse33) .cse34 (+ .cse36 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse33) .cse34 (+ .cse36 (- 3))))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse34) .cse32 .cse33)))))) c_~N~0)) .cse37))) (or (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse43 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse28))) (let ((.cse40 (select .cse43 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse44 (select .cse43 .cse42))) (store (store (store (store (store (store .cse43 |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse42 (+ .cse44 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse42 (+ .cse44 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse40) .cse42 (+ .cse44 (- 3))))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse42) .cse40 .cse41)))))) c_~N~0)) .cse29) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse50 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse27 (- 34359738368)) .cse28))) (let ((.cse46 (select .cse50 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (select .cse50 .cse49))) (store (store (store (store (store (store .cse50 |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse49 (+ .cse51 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse49 (+ .cse51 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse49 (+ .cse51 (- 3))))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse45 .cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse49))))))) c_~N~0)) .cse37)) .cse1))) (or .cse19 (and (or .cse37 (= (let ((.cse56 (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27 (- 34359738368)) .cse28))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse57 (select .cse56 .cse6))) (store (store (store (store (store (store .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse6 (+ .cse57 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse6 (+ .cse57 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse6 (+ .cse57 (- 3))))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse54 .cse55)))))) c_~N~0)) (or (= (let ((.cse62 (store .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse28))) (let ((.cse58 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse63 (select .cse62 .cse6))) (store (store (store (store (store (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) .cse6 (+ .cse63 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) .cse6 (+ .cse63 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) .cse6 (+ .cse63 (- 3))))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse61)))))) c_~N~0) .cse29)) .cse0)))))) is different from true [2023-02-15 19:06:58,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:07:07,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 19:07:14,013 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse84 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse87 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse86 (mod .cse84 4294967296))) (let ((.cse57 (<= .cse86 2147483647)) (.cse0 (<= .cse87 2147483647)) (.cse85 (* |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse46 (* .cse87 8))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse46)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse46 (- 34359738368))) (.cse31 (+ (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) .cse85 1)) (.cse18 (not .cse0)) (.cse38 (not (< .cse84 c_~N~0))) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse47 (* .cse86 8)) (.cse48 (+ (* .cse84 .cse84) .cse85 3)) (.cse49 (not .cse57)) (.cse19 (< 2 c_~N~0))) (and (or (let ((.cse10 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (and (or .cse0 (= (let ((.cse6 (store .cse8 .cse9 (+ .cse10 (select .cse8 .cse9))))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse1) .cse5 (+ .cse7 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1) .cse5 (+ .cse7 (- 2))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4)))))) c_~N~0)) (or (= (let ((.cse15 (store .cse8 .cse17 (+ (select .cse8 .cse17) .cse10)))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (select .cse15 .cse5))) (store (store (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse5 (+ .cse16 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse5 (+ .cse16 (- 2))))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse14)))))) c_~N~0) .cse18))) .cse19) (or (= (let ((.cse22 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (select .cse8 .cse5))) (store (store (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ .cse24 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ .cse24 (- 2))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse22 .cse23))))) c_~N~0) .cse19) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse19 (and (or .cse18 (= (let ((.cse29 (store .cse8 .cse17 .cse31))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (select .cse29 .cse5))) (store (store (store (store (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse5 (+ .cse30 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse5 (+ .cse30 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) .cse5 (+ .cse30 (- 3))))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse27 .cse28)))))) c_~N~0)) (or .cse0 (= (let ((.cse36 (store .cse8 .cse9 .cse31))) (let ((.cse32 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse37 (select .cse36 .cse5))) (store (store (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse5 (+ .cse37 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse5 (+ .cse37 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse5 (+ .cse37 (- 3))))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse35)))))) c_~N~0)))) (or .cse38 .cse19 (and (or .cse0 (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse44 (store (store .cse8 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse46 (- 34359738368)) .cse31) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse48))) (let ((.cse41 (select .cse44 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse43 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse45 (select .cse44 .cse43))) (store (store (store (store (store (store .cse44 |ULTIMATE.start_main_~a~0#1.offset| .cse41) .cse43 (+ .cse45 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse41) .cse43 (+ .cse45 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse41) .cse43 (+ .cse45 (- 3))))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse43) .cse41 .cse42)))))) c_~N~0)) .cse49) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse55 (store (store .cse8 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse46 (- 34359738368)) .cse31) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse47 (- 34359738368)) .cse48))) (let ((.cse53 (select .cse55 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse55 .cse54))) (store (store (store (store (store (store .cse55 |ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse54 (+ .cse56 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse54 (+ .cse56 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse54 (+ .cse56 (- 3))))))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse54) .cse52 .cse53)))))) c_~N~0)) .cse57))) (or (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse63 (store (store .cse8 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse31) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse48))) (let ((.cse60 (select .cse63 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse64 (select .cse63 .cse62))) (store (store (store (store (store (store .cse63 |ULTIMATE.start_main_~a~0#1.offset| .cse60) .cse62 (+ .cse64 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse60) .cse62 (+ .cse64 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse60) .cse62 (+ .cse64 (- 3))))))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse62) .cse60 .cse61)))))) c_~N~0)) .cse49) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (= (let ((.cse70 (store (store .cse8 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse46) .cse31) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse47 (- 34359738368)) .cse48))) (let ((.cse66 (select .cse70 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse69 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse71 (select .cse70 .cse69))) (store (store (store (store (store (store .cse70 |ULTIMATE.start_main_~a~0#1.offset| .cse66) .cse69 (+ .cse71 (- 1))) |ULTIMATE.start_main_~a~0#1.offset| .cse66) .cse69 (+ .cse71 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse66) .cse69 (+ .cse71 (- 3))))))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse65 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69))))))) c_~N~0)) .cse57)) .cse18))) (or .cse38 (and (or .cse57 (= (let ((.cse76 (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse47 (- 34359738368)) .cse48))) (let ((.cse74 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse77 (select .cse76 .cse5))) (store (store (store (store (store (store .cse76 |c_ULTIMATE.start_main_~a~0#1.offset| .cse74) .cse5 (+ .cse77 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse74) .cse5 (+ .cse77 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse74) .cse5 (+ .cse77 (- 3))))))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse75 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse74 .cse75)))))) c_~N~0)) (or (= (let ((.cse82 (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse48))) (let ((.cse78 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse83 (select .cse82 .cse5))) (store (store (store (store (store (store .cse82 |c_ULTIMATE.start_main_~a~0#1.offset| .cse78) .cse5 (+ .cse83 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse78) .cse5 (+ .cse83 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse78) .cse5 (+ .cse83 (- 3))))))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse81)))))) c_~N~0) .cse49)) .cse19)))))) is different from true