./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 f4b24e32 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-?-f4b24e3 [2022-07-13 11:07:22,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:07:22,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:07:22,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:07:22,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:07:22,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:07:22,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:07:22,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:07:22,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:07:22,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:07:22,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:07:22,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:07:22,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:07:22,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:07:22,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:07:22,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:07:22,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:07:22,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:07:22,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:07:22,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:07:22,974 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:07:22,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:07:22,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:07:22,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:07:22,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:07:22,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:07:22,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:07:22,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:07:22,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:07:22,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:07:22,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:07:22,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:07:22,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:07:22,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:07:22,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:07:22,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:07:22,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:07:22,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:07:22,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:07:22,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:07:22,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:07:22,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:07:22,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:07:23,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:07:23,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:07:23,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:07:23,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:07:23,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:07:23,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:07:23,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:07:23,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:07:23,015 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:07:23,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:07:23,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:07:23,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:07:23,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:07:23,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:07:23,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:07:23,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:07:23,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:07:23,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:07:23,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:07:23,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:07:23,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:07:23,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:07:23,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:07:23,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:07:23,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:07:23,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:07:23,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:07:23,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:07:23,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:07:23,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:07:23,019 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:07:23,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:07:23,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:07:23,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 [2022-07-13 11:07:23,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:07:23,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:07:23,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:07:23,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:07:23,239 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:07:23,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp5.c [2022-07-13 11:07:23,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427a32199/852b85e96dc04099b217353e6883dd18/FLAG86cb13177 [2022-07-13 11:07:23,599 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:07:23,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c [2022-07-13 11:07:23,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427a32199/852b85e96dc04099b217353e6883dd18/FLAG86cb13177 [2022-07-13 11:07:24,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427a32199/852b85e96dc04099b217353e6883dd18 [2022-07-13 11:07:24,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:07:24,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:07:24,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:07:24,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:07:24,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:07:24,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba73a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24, skipping insertion in model container [2022-07-13 11:07:24,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:07:24,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:07:24,163 WARN L230 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] [2022-07-13 11:07:24,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:07:24,196 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:07:24,206 WARN L230 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] [2022-07-13 11:07:24,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:07:24,241 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:07:24,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24 WrapperNode [2022-07-13 11:07:24,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:07:24,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:07:24,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:07:24,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:07:24,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,275 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-07-13 11:07:24,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:07:24,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:07:24,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:07:24,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:07:24,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:07:24,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:07:24,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:07:24,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:07:24,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (1/1) ... [2022-07-13 11:07:24,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:07:24,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:07:24,349 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) [2022-07-13 11:07:24,371 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 [2022-07-13 11:07:24,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:07:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:07:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:07:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:07:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:07:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:07:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:07:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:07:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:07:24,436 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:07:24,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:07:24,553 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:07:24,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:07:24,557 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 11:07:24,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:07:24 BoogieIcfgContainer [2022-07-13 11:07:24,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:07:24,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:07:24,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:07:24,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:07:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:07:24" (1/3) ... [2022-07-13 11:07:24,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5b7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:07:24, skipping insertion in model container [2022-07-13 11:07:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:07:24" (2/3) ... [2022-07-13 11:07:24,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5b7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:07:24, skipping insertion in model container [2022-07-13 11:07:24,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:07:24" (3/3) ... [2022-07-13 11:07:24,565 INFO L111 eAbstractionObserver]: Analyzing ICFG indp5.c [2022-07-13 11:07:24,575 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:07:24,575 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:07:24,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:07:24,627 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6fea22bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6568848f [2022-07-13 11:07:24,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:07:24,644 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) [2022-07-13 11:07:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:07:24,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:07:24,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:07:24,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:07:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:07:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2022-07-13 11:07:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:07:24,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187380849] [2022-07-13 11:07:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:24,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:07:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:07:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:07:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:07:24,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187380849] [2022-07-13 11:07:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187380849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:07:24,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:07:24,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:07:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161988021] [2022-07-13 11:07:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:07:24,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:07:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:07:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:07:24,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:07:24,827 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) [2022-07-13 11:07:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:07:24,841 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-13 11:07:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:07:24,844 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 [2022-07-13 11:07:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:07:24,849 INFO L225 Difference]: With dead ends: 50 [2022-07-13 11:07:24,849 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 11:07:24,853 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 [2022-07-13 11:07:24,858 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 [2022-07-13 11:07:24,860 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] [2022-07-13 11:07:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 11:07:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 11:07:24,884 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) [2022-07-13 11:07:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 11:07:24,886 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2022-07-13 11:07:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:07:24,886 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 11:07:24,886 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) [2022-07-13 11:07:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 11:07:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:07:24,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:07:24,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:07:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:07:24,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:07:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:07:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2022-07-13 11:07:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:07:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737763708] [2022-07-13 11:07:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:07:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:07:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:07:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:07:24,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737763708] [2022-07-13 11:07:24,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737763708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:07:24,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:07:24,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:07:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268383833] [2022-07-13 11:07:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:07:24,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:07:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:07:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:07:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:07:24,953 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) [2022-07-13 11:07:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:07:25,018 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-07-13 11:07:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:07:25,018 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 [2022-07-13 11:07:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:07:25,019 INFO L225 Difference]: With dead ends: 49 [2022-07-13 11:07:25,019 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 11:07:25,023 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 [2022-07-13 11:07:25,024 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:07:25,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:07:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 11:07:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-13 11:07:25,029 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) [2022-07-13 11:07:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 11:07:25,029 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-07-13 11:07:25,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:07:25,030 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 11:07:25,030 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) [2022-07-13 11:07:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 11:07:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:07:25,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:07:25,031 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] [2022-07-13 11:07:25,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:07:25,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:07:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:07:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2022-07-13 11:07:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:07:25,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948711019] [2022-07-13 11:07:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:07:25,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:07:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917894088] [2022-07-13 11:07:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:25,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:07:25,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:07:25,056 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) [2022-07-13 11:07:25,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:07:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:07:25,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 11:07:25,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:07:25,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:07:25,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 67 [2022-07-13 11:07:25,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 99 [2022-07-13 11:07:25,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 9 [2022-07-13 11:07:25,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:25,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:25,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:25,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:25,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:25,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 25 [2022-07-13 11:07:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:07:25,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:07:30,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:07:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:07:30,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:07:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948711019] [2022-07-13 11:07:30,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:07:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917894088] [2022-07-13 11:07:30,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917894088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:07:30,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:07:30,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2022-07-13 11:07:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099533632] [2022-07-13 11:07:30,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:07:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:07:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:07:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:07:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=240, Unknown=1, NotChecked=0, Total=306 [2022-07-13 11:07:30,739 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:07:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:07:33,602 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2022-07-13 11:07:33,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:07:33,603 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 11:07:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:07:33,605 INFO L225 Difference]: With dead ends: 80 [2022-07-13 11:07:33,605 INFO L226 Difference]: Without dead ends: 75 [2022-07-13 11:07:33,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=148, Invalid=501, Unknown=1, NotChecked=0, Total=650 [2022-07-13 11:07:33,606 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:07:33,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 248 Invalid, 0 Unknown, 48 Unchecked, 1.3s Time] [2022-07-13 11:07:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-13 11:07:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2022-07-13 11:07:33,619 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) [2022-07-13 11:07:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-07-13 11:07:33,620 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 27 [2022-07-13 11:07:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:07:33,620 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-13 11:07:33,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:07:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-07-13 11:07:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:07:33,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:07:33,622 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] [2022-07-13 11:07:33,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:07:33,835 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 [2022-07-13 11:07:33,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:07:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:07:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2022-07-13 11:07:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:07:33,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684942669] [2022-07-13 11:07:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:07:33,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:07:33,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418675737] [2022-07-13 11:07:33,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:07:33,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:07:33,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:07:33,873 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) [2022-07-13 11:07:33,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:07:33,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:07:33,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:07:33,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:07:33,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:07:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:07:33,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:07:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:07:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:07:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684942669] [2022-07-13 11:07:33,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:07:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418675737] [2022-07-13 11:07:33,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418675737] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:07:33,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:07:33,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:07:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209491836] [2022-07-13 11:07:33,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:07:33,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:07:33,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:07:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:07:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:07:33,980 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) [2022-07-13 11:07:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:07:34,127 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2022-07-13 11:07:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:07:34,128 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 [2022-07-13 11:07:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:07:34,129 INFO L225 Difference]: With dead ends: 126 [2022-07-13 11:07:34,129 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 11:07:34,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:07:34,130 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:07:34,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 33 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:07:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 11:07:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2022-07-13 11:07:34,137 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) [2022-07-13 11:07:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-13 11:07:34,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2022-07-13 11:07:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:07:34,139 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-13 11:07:34,139 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) [2022-07-13 11:07:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-13 11:07:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:07:34,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:07:34,144 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] [2022-07-13 11:07:34,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 11:07:34,355 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 [2022-07-13 11:07:34,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:07:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:07:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2022-07-13 11:07:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:07:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268837185] [2022-07-13 11:07:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:07:34,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:07:34,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714024639] [2022-07-13 11:07:34,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:07:34,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:07:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:07:34,377 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) [2022-07-13 11:07:34,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:07:34,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:07:34,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:07:34,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:07:34,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:07:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:07:34,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:07:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:07:34,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:07:34,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268837185] [2022-07-13 11:07:34,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:07:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714024639] [2022-07-13 11:07:34,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714024639] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:07:34,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:07:34,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:07:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317592443] [2022-07-13 11:07:34,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:07:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:07:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:07:34,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:07:34,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:07:34,512 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) [2022-07-13 11:07:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:07:34,631 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-13 11:07:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:07:34,631 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 [2022-07-13 11:07:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:07:34,632 INFO L225 Difference]: With dead ends: 58 [2022-07-13 11:07:34,632 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:07:34,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:07:34,633 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:07:34,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 18 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:07:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:07:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-13 11:07:34,636 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) [2022-07-13 11:07:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-13 11:07:34,637 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2022-07-13 11:07:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:07:34,637 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-13 11:07:34,637 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) [2022-07-13 11:07:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-13 11:07:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:07:34,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:07:34,638 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] [2022-07-13 11:07:34,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:07:34,843 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 [2022-07-13 11:07:34,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:07:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:07:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2022-07-13 11:07:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:07:34,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569210209] [2022-07-13 11:07:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:07:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:07:34,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:07:34,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554540490] [2022-07-13 11:07:34,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:07:34,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:07:34,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:07:34,880 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) [2022-07-13 11:07:34,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:07:35,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:07:35,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:07:35,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-13 11:07:35,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:07:35,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:07:35,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 67 [2022-07-13 11:07:35,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 99 [2022-07-13 11:07:35,055 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:07:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,105 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 11:07:35,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 11:07:35,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 116 [2022-07-13 11:07:35,242 INFO L356 Elim1Store]: treesize reduction 318, result has 10.2 percent of original size [2022-07-13 11:07:35,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 case distinctions, treesize of input 105 treesize of output 160 [2022-07-13 11:07:35,312 INFO L356 Elim1Store]: treesize reduction 327, result has 3.8 percent of original size [2022-07-13 11:07:35,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 49 [2022-07-13 11:07:35,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,370 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 11:07:35,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-13 11:07:35,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:35,477 INFO L356 Elim1Store]: treesize reduction 320, result has 9.6 percent of original size [2022-07-13 11:07:35,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 case distinctions, treesize of input 101 treesize of output 154 [2022-07-13 11:07:35,485 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:07:35,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,588 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 11:07:35,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-13 11:07:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:35,713 INFO L356 Elim1Store]: treesize reduction 320, result has 9.6 percent of original size [2022-07-13 11:07:35,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 case distinctions, treesize of input 101 treesize of output 154 [2022-07-13 11:07:35,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 25 [2022-07-13 11:07:35,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,817 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 11:07:35,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-13 11:07:35,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,899 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-07-13 11:07:35,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:35,979 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-07-13 11:07:35,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:36,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:07:36,166 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 11:07:36,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:07:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:07:36,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:08:29,982 WARN L233 SmtUtils]: Spent 14.41s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:09:41,530 WARN L233 SmtUtils]: Spent 35.45s on a formula simplification. DAG size of input: 92 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:09:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:09:41,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:09:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569210209] [2022-07-13 11:09:41,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:09:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554540490] [2022-07-13 11:09:41,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554540490] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:09:41,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:09:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2022-07-13 11:09:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142160243] [2022-07-13 11:09:41,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:09:41,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 11:09:41,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:09:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 11:09:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1679, Unknown=10, NotChecked=0, Total=1892 [2022-07-13 11:09:41,567 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 44 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 44 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:09:42,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:09:53,330 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse67 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse59 (* .cse67 8))) (let ((.cse58 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse43 (<= .cse67 2147483647)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse60 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (* .cse2 .cse2))) (let ((.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse65 (store .cse8 .cse60 .cse44))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse66 (select .cse65 .cse7))) (store (store (store (store (store (store .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 1) .cse66)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 2) .cse66)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 3) .cse66)))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse63 .cse64))))))) (.cse10 (< 2 c_~N~0)) (.cse11 (not .cse43)) (.cse18 (store .cse8 .cse60 (+ .cse58 (select .cse8 .cse60)))) (.cse36 (let ((.cse57 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse8 .cse57 (+ .cse58 (select .cse8 .cse57)))))) (and (or .cse0 (<= .cse1 .cse2)) (or (= c_~N~0 (let ((.cse6 (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| .cse6) .cse7 (+ (- 1) .cse9)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 3))))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (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)))))) .cse10) (or .cse10 (let ((.cse46 (mod .cse2 4294967296))) (let ((.cse22 (<= .cse46 2147483647)) (.cse45 (* .cse46 8))) (let ((.cse29 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse19 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (* (- 1) .cse44)) (.cse21 (not .cse22))) (and (or .cse11 (and (or (= c_~N~0 (let ((.cse16 (store .cse18 .cse19 (+ (select .cse18 .cse19) .cse20)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (select .cse16 .cse7))) (store (store (store (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 1) .cse17)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 2) .cse17)))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15))))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse27 (store .cse18 .cse29 (+ .cse20 (select .cse18 .cse29))))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (select .cse27 .cse7))) (store (store (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 2))))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse26)))))))))) (or (and (or .cse22 (= c_~N~0 (let ((.cse34 (store .cse36 .cse29 (+ (select .cse36 .cse29) .cse20)))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse7))) (store (store (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 1) .cse35)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 2) .cse35)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse33)))))))) (or (= c_~N~0 (let ((.cse41 (store .cse36 .cse19 (+ (select .cse36 .cse19) .cse20)))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (select .cse41 .cse7))) (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 1) .cse42)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 2) .cse42)))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse40))))))) .cse21)) .cse43)))))) (or .cse0 (<= 2 .cse1)) (or .cse10 (and (or .cse11 (= (let ((.cse47 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (select .cse18 .cse7))) (store (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse7 (+ (- 1) .cse51)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse7 (+ (- 2) .cse51)))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse47 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse50))))) c_~N~0)) (or .cse43 (= (let ((.cse55 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse36 .cse7))) (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) .cse7 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) .cse7 (+ (- 2) .cse56)))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse55))))) c_~N~0))))))))) is different from true [2022-07-13 11:10:09,731 WARN L233 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 124 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:10:57,474 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 205 DAG size of output: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:11:00,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:02,687 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse74 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse73 (mod .cse2 4294967296)) (.cse63 (* .cse74 8))) (let ((.cse62 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse37 (<= .cse74 2147483647)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse64 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (<= .cse73 2147483647)) (.cse71 (* .cse2 .cse2)) (.cse72 (* .cse73 8))) (let ((.cse23 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse13 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (* (- 1) .cse71)) (.cse15 (not .cse16)) (.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse69 (store .cse44 .cse64 .cse71))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (select .cse69 .cse9))) (store (store (store (store (store (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 1) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 2) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 3) .cse70)))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse67 .cse68))))))) (.cse3 (< 2 c_~N~0)) (.cse4 (not .cse37)) (.cse12 (store .cse44 .cse64 (+ .cse62 (select .cse44 .cse64)))) (.cse30 (let ((.cse61 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse44 .cse61 (+ .cse62 (select .cse44 .cse61)))))) (and (or .cse0 (<= .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (or .cse3 (and (or .cse4 (and (or (= c_~N~0 (let ((.cse10 (store .cse12 .cse13 (+ (select .cse12 .cse13) .cse14)))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (select .cse10 .cse9))) (store (store (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) .cse9 (+ (- 1) .cse11)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) .cse9 (+ (- 2) .cse11)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))) .cse15) (or .cse16 (= c_~N~0 (let ((.cse21 (store .cse12 .cse23 (+ .cse14 (select .cse12 .cse23))))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (select .cse21 .cse9))) (store (store (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) .cse9 (+ .cse22 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) .cse9 (+ .cse22 (- 2))))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse20)))))))))) (or (and (or .cse16 (= c_~N~0 (let ((.cse28 (store .cse30 .cse23 (+ (select .cse30 .cse23) .cse14)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse29 (select .cse28 .cse9))) (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) .cse9 (+ (- 1) .cse29)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) .cse9 (+ (- 2) .cse29)))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse27)))))))) (or (= c_~N~0 (let ((.cse35 (store .cse30 .cse13 (+ (select .cse30 .cse13) .cse14)))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (select .cse35 .cse9))) (store (store (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse9 (+ (- 1) .cse36)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse9 (+ (- 2) .cse36)))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse34))))))) .cse15)) .cse37))) (or (and (or .cse16 (= (let ((.cse42 (store .cse44 .cse23 (+ .cse14 (select .cse44 .cse23))))) (let ((.cse38 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (select .cse42 .cse9))) (store (store (store (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse9 (+ (- 1) .cse43)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse9 (+ (- 2) .cse43)))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse38 .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))) c_~N~0)) (or (= (let ((.cse49 (store .cse44 .cse13 (+ (select .cse44 .cse13) .cse14)))) (let ((.cse45 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (select .cse49 .cse9))) (store (store (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse9 (+ (- 1) .cse50)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse9 (+ (- 2) .cse50)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse48)))))) c_~N~0) .cse15)) .cse3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (< 1 c_~N~0) (or .cse0 (<= 2 .cse1)) (= (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or .cse3 (and (or .cse4 (= (let ((.cse51 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (select .cse12 .cse9))) (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse9 (+ (- 1) .cse55)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse9 (+ (- 2) .cse55)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse54))))) c_~N~0)) (or .cse37 (= (let ((.cse59 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (select .cse30 .cse9))) (store (store (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse9 (+ (- 1) .cse60)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse9 (+ (- 2) .cse60)))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse59))))) c_~N~0)))) (= (select .cse44 .cse9) 3)))))) is different from false [2022-07-13 11:11:04,711 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse74 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse73 (mod .cse2 4294967296)) (.cse63 (* .cse74 8))) (let ((.cse62 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse37 (<= .cse74 2147483647)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse64 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (<= .cse73 2147483647)) (.cse71 (* .cse2 .cse2)) (.cse72 (* .cse73 8))) (let ((.cse23 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse13 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (* (- 1) .cse71)) (.cse15 (not .cse16)) (.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse69 (store .cse44 .cse64 .cse71))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (select .cse69 .cse9))) (store (store (store (store (store (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 1) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 2) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 3) .cse70)))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse67 .cse68))))))) (.cse3 (< 2 c_~N~0)) (.cse4 (not .cse37)) (.cse12 (store .cse44 .cse64 (+ .cse62 (select .cse44 .cse64)))) (.cse30 (let ((.cse61 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse44 .cse61 (+ .cse62 (select .cse44 .cse61)))))) (and (or .cse0 (<= .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (or .cse3 (and (or .cse4 (and (or (= c_~N~0 (let ((.cse10 (store .cse12 .cse13 (+ (select .cse12 .cse13) .cse14)))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (select .cse10 .cse9))) (store (store (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) .cse9 (+ (- 1) .cse11)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) .cse9 (+ (- 2) .cse11)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))) .cse15) (or .cse16 (= c_~N~0 (let ((.cse21 (store .cse12 .cse23 (+ .cse14 (select .cse12 .cse23))))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (select .cse21 .cse9))) (store (store (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) .cse9 (+ .cse22 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) .cse9 (+ .cse22 (- 2))))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse20)))))))))) (or (and (or .cse16 (= c_~N~0 (let ((.cse28 (store .cse30 .cse23 (+ (select .cse30 .cse23) .cse14)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse29 (select .cse28 .cse9))) (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) .cse9 (+ (- 1) .cse29)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) .cse9 (+ (- 2) .cse29)))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse27)))))))) (or (= c_~N~0 (let ((.cse35 (store .cse30 .cse13 (+ (select .cse30 .cse13) .cse14)))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (select .cse35 .cse9))) (store (store (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse9 (+ (- 1) .cse36)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse9 (+ (- 2) .cse36)))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse34))))))) .cse15)) .cse37))) (or (and (or .cse16 (= (let ((.cse42 (store .cse44 .cse23 (+ .cse14 (select .cse44 .cse23))))) (let ((.cse38 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (select .cse42 .cse9))) (store (store (store (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse9 (+ (- 1) .cse43)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse9 (+ (- 2) .cse43)))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse38 .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))) c_~N~0)) (or (= (let ((.cse49 (store .cse44 .cse13 (+ (select .cse44 .cse13) .cse14)))) (let ((.cse45 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (select .cse49 .cse9))) (store (store (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse9 (+ (- 1) .cse50)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse9 (+ (- 2) .cse50)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse48)))))) c_~N~0) .cse15)) .cse3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (< 1 c_~N~0) (or .cse0 (<= 2 .cse1)) (= (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or .cse3 (and (or .cse4 (= (let ((.cse51 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (select .cse12 .cse9))) (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse9 (+ (- 1) .cse55)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse9 (+ (- 2) .cse55)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse54))))) c_~N~0)) (or .cse37 (= (let ((.cse59 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (select .cse30 .cse9))) (store (store (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse9 (+ (- 1) .cse60)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse9 (+ (- 2) .cse60)))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse59))))) c_~N~0)))) (= (select .cse44 .cse9) 3)))))) is different from true [2022-07-13 11:11:06,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:25,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:38,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:39,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:44,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:46,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:51,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse66 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse65 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse67 (* .cse66 8))) (let ((.cse39 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (<= .cse66 2147483647)) (.cse8 (<= .cse65 2147483647)) (.cse64 (* .cse65 8))) (let ((.cse15 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse17 (not .cse8)) (.cse23 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (< 2 c_~N~0)) (.cse26 (not .cse27)) (.cse25 (select .cse5 .cse24)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse5 .cse39))) (and (or (= c_~N~0 (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (select .cse5 .cse4))) (store (store (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ (- 1) .cse6)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ .cse6 (- 2))))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3)))))) .cse7) (or .cse7 (and (or (let ((.cse14 (store .cse5 .cse24 (+ .cse16 .cse25)))) (and (or .cse8 (= c_~N~0 (let ((.cse13 (store .cse14 .cse15 (+ (- 1) (select .cse14 .cse15) .cse16)))) (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| (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse4 (+ (- 1) (select .cse13 .cse4)))))) (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|) .cse4) .cse12)))))))) (or .cse17 (= c_~N~0 (let ((.cse22 (store .cse14 .cse23 (+ (- 1) .cse16 (select .cse14 .cse23))))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| .cse20) .cse4 (+ (- 1) (select .cse22 .cse4)))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse20 .cse21)))))))))) .cse26) (or .cse27 (let ((.cse33 (store .cse5 .cse39 (+ .cse16 .cse40)))) (and (or .cse8 (= c_~N~0 (let ((.cse32 (store .cse33 .cse15 (+ (- 1) (select .cse33 .cse15) .cse16)))) (let ((.cse28 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) .cse4 (+ (- 1) (select .cse32 .cse4)))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse31)))))))) (or (= (let ((.cse38 (store .cse33 .cse23 (+ (- 1) .cse16 (select .cse33 .cse23))))) (let ((.cse35 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse4 (+ (- 1) (select .cse38 .cse4)))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) c_~N~0) .cse17)))))) (or (and (or .cse8 (= (let ((.cse45 (store .cse5 .cse15 (+ (- 1) .cse16 (select .cse5 .cse15))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse4 (+ (- 1) (select .cse45 .cse4)))))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse43 .cse44)))))) c_~N~0)) (or .cse17 (= c_~N~0 (let ((.cse50 (store .cse5 .cse23 (+ (- 1) (select .cse5 .cse23) .cse16)))) (let ((.cse48 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| .cse48) .cse4 (+ (- 1) (select .cse50 .cse4)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse48 .cse49))))))))) .cse7) (or .cse7 (let ((.cse57 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)))) (and (or .cse26 (= (let ((.cse55 (store .cse5 .cse24 (+ .cse57 .cse25)))) (let ((.cse51 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse55 .cse4))) (store (store (store (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse4 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse4 (+ (- 2) .cse56)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse54)))))) c_~N~0)) (or .cse27 (= (let ((.cse62 (store .cse5 .cse39 (+ .cse57 .cse40)))) (let ((.cse61 (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 .cse4))) (store (store (store (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61) .cse4 (+ (- 1) .cse63)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse61) .cse4 (+ (- 2) .cse63)))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (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|) .cse4) .cse61)))))) c_~N~0)))))))))) is different from false [2022-07-13 11:11:53,583 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse66 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse65 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse67 (* .cse66 8))) (let ((.cse39 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (<= .cse66 2147483647)) (.cse8 (<= .cse65 2147483647)) (.cse64 (* .cse65 8))) (let ((.cse15 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse17 (not .cse8)) (.cse23 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (< 2 c_~N~0)) (.cse26 (not .cse27)) (.cse25 (select .cse5 .cse24)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse40 (select .cse5 .cse39))) (and (or (= c_~N~0 (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (select .cse5 .cse4))) (store (store (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ (- 1) .cse6)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ .cse6 (- 2))))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3)))))) .cse7) (or .cse7 (and (or (let ((.cse14 (store .cse5 .cse24 (+ .cse16 .cse25)))) (and (or .cse8 (= c_~N~0 (let ((.cse13 (store .cse14 .cse15 (+ (- 1) (select .cse14 .cse15) .cse16)))) (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| (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse4 (+ (- 1) (select .cse13 .cse4)))))) (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|) .cse4) .cse12)))))))) (or .cse17 (= c_~N~0 (let ((.cse22 (store .cse14 .cse23 (+ (- 1) .cse16 (select .cse14 .cse23))))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| .cse20) .cse4 (+ (- 1) (select .cse22 .cse4)))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse20 .cse21)))))))))) .cse26) (or .cse27 (let ((.cse33 (store .cse5 .cse39 (+ .cse16 .cse40)))) (and (or .cse8 (= c_~N~0 (let ((.cse32 (store .cse33 .cse15 (+ (- 1) (select .cse33 .cse15) .cse16)))) (let ((.cse28 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) .cse4 (+ (- 1) (select .cse32 .cse4)))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse31)))))))) (or (= (let ((.cse38 (store .cse33 .cse23 (+ (- 1) .cse16 (select .cse33 .cse23))))) (let ((.cse35 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse4 (+ (- 1) (select .cse38 .cse4)))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) c_~N~0) .cse17)))))) (or (and (or .cse8 (= (let ((.cse45 (store .cse5 .cse15 (+ (- 1) .cse16 (select .cse5 .cse15))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse4 (+ (- 1) (select .cse45 .cse4)))))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse43 .cse44)))))) c_~N~0)) (or .cse17 (= c_~N~0 (let ((.cse50 (store .cse5 .cse23 (+ (- 1) (select .cse5 .cse23) .cse16)))) (let ((.cse48 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| .cse48) .cse4 (+ (- 1) (select .cse50 .cse4)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse48 .cse49))))))))) .cse7) (or .cse7 (let ((.cse57 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)))) (and (or .cse26 (= (let ((.cse55 (store .cse5 .cse24 (+ .cse57 .cse25)))) (let ((.cse51 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse55 .cse4))) (store (store (store (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse4 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse4 (+ (- 2) .cse56)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse54)))))) c_~N~0)) (or .cse27 (= (let ((.cse62 (store .cse5 .cse39 (+ .cse57 .cse40)))) (let ((.cse61 (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 .cse4))) (store (store (store (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61) .cse4 (+ (- 1) .cse63)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse61) .cse4 (+ (- 2) .cse63)))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (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|) .cse4) .cse61)))))) c_~N~0)))))))))) is different from true [2022-07-13 11:11:55,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:57,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-13 11:11:59,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []