./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/ss1.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 26cc6c43657aae3d6045b0e296032a25844d2e64f01344915dc1323c4b8b39f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:16:38,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:16:38,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:16:38,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:16:38,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:16:38,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:16:38,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:16:38,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:16:38,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:16:38,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:16:38,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:16:38,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:16:38,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:16:38,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:16:38,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:16:38,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:16:38,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:16:38,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:16:38,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:16:38,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:16:38,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:16:38,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:16:38,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:16:38,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:16:38,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:16:38,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:16:38,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:16:38,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:16:38,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:16:38,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:16:38,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:16:38,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:16:38,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:16:38,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:16:38,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:16:38,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:16:38,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:16:38,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:16:38,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:16:38,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:16:38,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:16:38,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:16:38,445 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:16:38,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:16:38,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:16:38,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:16:38,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:16:38,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:16:38,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:16:38,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:16:38,449 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:16:38,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:16:38,449 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:16:38,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:16:38,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:16:38,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:16:38,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:16:38,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:16:38,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:16:38,451 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:16:38,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:16:38,451 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:16:38,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:16:38,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:16:38,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:16:38,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:16:38,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:16:38,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:16:38,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:16:38,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:16:38,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:16:38,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:16:38,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:16:38,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:16:38,453 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:16:38,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:16:38,453 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:16:38,454 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26cc6c43657aae3d6045b0e296032a25844d2e64f01344915dc1323c4b8b39f3 [2023-02-15 10:16:38,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:16:38,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:16:38,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:16:38,637 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:16:38,638 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:16:38,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss1.c [2023-02-15 10:16:39,570 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:16:39,695 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:16:39,696 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss1.c [2023-02-15 10:16:39,699 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7ab58f9/5a4457afe33e46b49030d7fc3dfdb65c/FLAG2bdac5046 [2023-02-15 10:16:39,707 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7ab58f9/5a4457afe33e46b49030d7fc3dfdb65c [2023-02-15 10:16:39,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:16:39,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:16:39,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:16:39,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:16:39,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:16:39,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ff2c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39, skipping insertion in model container [2023-02-15 10:16:39,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:16:39,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:16:39,812 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss1.c[586,599] [2023-02-15 10:16:39,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:16:39,842 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:16:39,852 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss1.c[586,599] [2023-02-15 10:16:39,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:16:39,868 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:16:39,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39 WrapperNode [2023-02-15 10:16:39,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:16:39,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:16:39,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:16:39,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:16:39,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,899 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-02-15 10:16:39,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:16:39,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:16:39,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:16:39,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:16:39,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:16:39,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:16:39,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:16:39,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:16:39,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (1/1) ... [2023-02-15 10:16:39,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:16:39,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:39,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:16:39,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:16:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:16:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:16:40,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:16:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:16:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:16:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:16:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:16:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:16:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:16:40,086 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:16:40,087 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:16:40,262 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:16:40,266 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:16:40,266 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:16:40,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:16:40 BoogieIcfgContainer [2023-02-15 10:16:40,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:16:40,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:16:40,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:16:40,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:16:40,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:16:39" (1/3) ... [2023-02-15 10:16:40,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0760b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:16:40, skipping insertion in model container [2023-02-15 10:16:40,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:16:39" (2/3) ... [2023-02-15 10:16:40,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0760b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:16:40, skipping insertion in model container [2023-02-15 10:16:40,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:16:40" (3/3) ... [2023-02-15 10:16:40,281 INFO L112 eAbstractionObserver]: Analyzing ICFG ss1.c [2023-02-15 10:16:40,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:16:40,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:16:40,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:16:40,327 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e5222a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:16:40,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:16:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 10:16:40,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:40,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:16:40,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2023-02-15 10:16:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:40,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950874113] [2023-02-15 10:16:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:16:40,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950874113] [2023-02-15 10:16:40,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 10:16:40,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983141320] [2023-02-15 10:16:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:40,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:40,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:40,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:16:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:16:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:40,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:16:40,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:40,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:16:40,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983141320] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:16:40,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:16:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:16:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276271829] [2023-02-15 10:16:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:16:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:16:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:16:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:16:40,594 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:16:40,603 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-02-15 10:16:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:16:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 10:16:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:16:40,610 INFO L225 Difference]: With dead ends: 44 [2023-02-15 10:16:40,610 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 10:16:40,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:16:40,614 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:16:40,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:16:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 10:16:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-15 10:16:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-15 10:16:40,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2023-02-15 10:16:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:16:40,633 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-15 10:16:40,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-15 10:16:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 10:16:40,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:40,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:16:40,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:16:40,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 10:16:40,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2023-02-15 10:16:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:40,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677180315] [2023-02-15 10:16:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:40,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:16:40,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677180315] [2023-02-15 10:16:40,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 10:16:40,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998136848] [2023-02-15 10:16:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:40,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:16:40,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:16:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:40,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:16:40,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:40,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:16:40,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998136848] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:16:40,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:16:40,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:16:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197449236] [2023-02-15 10:16:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:16:40,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:16:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:16:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:16:40,972 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:16:41,006 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-02-15 10:16:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:16:41,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 10:16:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:16:41,007 INFO L225 Difference]: With dead ends: 41 [2023-02-15 10:16:41,008 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 10:16:41,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:16:41,009 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:16:41,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:16:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 10:16:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-02-15 10:16:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 10:16:41,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2023-02-15 10:16:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:16:41,013 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 10:16:41,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 10:16:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:16:41,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:41,014 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] [2023-02-15 10:16:41,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:16:41,230 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,SelfDestructingSolverStorable1 [2023-02-15 10:16:41,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2023-02-15 10:16:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459362810] [2023-02-15 10:16:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:41,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:16:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358371633] [2023-02-15 10:16:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:41,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:41,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:16:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:16:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:16:41,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 10:16:41,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:41,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:16:41,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:41,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:16:41,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:41,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:16:41,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:41,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2023-02-15 10:16:41,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:41,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2023-02-15 10:16:41,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:41,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2023-02-15 10:16:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:41,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:16:42,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:42,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:16:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459362810] [2023-02-15 10:16:42,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:16:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358371633] [2023-02-15 10:16:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358371633] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:16:42,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:16:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-02-15 10:16:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188618206] [2023-02-15 10:16:42,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:16:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 10:16:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 10:16:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2023-02-15 10:16:42,239 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:16:47,397 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-02-15 10:16:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 10:16:47,398 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:16:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:16:47,398 INFO L225 Difference]: With dead ends: 51 [2023-02-15 10:16:47,398 INFO L226 Difference]: Without dead ends: 41 [2023-02-15 10:16:47,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 10:16:47,400 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:16:47,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 49 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:16:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-15 10:16:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2023-02-15 10:16:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-02-15 10:16:47,410 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2023-02-15 10:16:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:16:47,410 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-02-15 10:16:47,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-02-15 10:16:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:16:47,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:47,411 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] [2023-02-15 10:16:47,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 10:16:47,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:47,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2023-02-15 10:16:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365666284] [2023-02-15 10:16:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:47,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:16:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956051259] [2023-02-15 10:16:47,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:16:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:47,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:16:47,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:16:47,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:16:47,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:16:47,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:16:47,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:16:47,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:16:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:16:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:16:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365666284] [2023-02-15 10:16:47,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:16:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956051259] [2023-02-15 10:16:47,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956051259] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:16:47,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:16:47,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:16:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769934379] [2023-02-15 10:16:47,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:16:47,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:16:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:16:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:16:47,779 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:16:47,868 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-02-15 10:16:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:16:47,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 25 [2023-02-15 10:16:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:16:47,869 INFO L225 Difference]: With dead ends: 80 [2023-02-15 10:16:47,869 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 10:16:47,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:16:47,870 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:16:47,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 30 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:16:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 10:16:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2023-02-15 10:16:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-15 10:16:47,877 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2023-02-15 10:16:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:16:47,877 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-15 10:16:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-15 10:16:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:16:47,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:47,878 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] [2023-02-15 10:16:47,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 10:16:48,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:48,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 119582130, now seen corresponding path program 3 times [2023-02-15 10:16:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:48,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197833235] [2023-02-15 10:16:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:48,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:16:48,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109902537] [2023-02-15 10:16:48,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:16:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:48,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:16:48,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:16:48,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:16:48,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:16:48,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:16:48,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:16:48,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:16:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:16:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:16:48,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197833235] [2023-02-15 10:16:48,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:16:48,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109902537] [2023-02-15 10:16:48,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109902537] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:16:48,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:16:48,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:16:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42894496] [2023-02-15 10:16:48,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:16:48,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:16:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:16:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:16:48,212 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:16:48,300 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-02-15 10:16:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:16:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 25 [2023-02-15 10:16:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:16:48,301 INFO L225 Difference]: With dead ends: 47 [2023-02-15 10:16:48,301 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 10:16:48,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:16:48,302 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:16:48,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 23 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:16:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 10:16:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-15 10:16:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-15 10:16:48,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2023-02-15 10:16:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:16:48,307 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-15 10:16:48,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:16:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-15 10:16:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 10:16:48,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:16:48,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:16:48,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:16:48,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:48,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:16:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:16:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2023-02-15 10:16:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:16:48,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797389948] [2023-02-15 10:16:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:16:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:16:48,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:16:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630277489] [2023-02-15 10:16:48,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:16:48,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:16:48,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:16:48,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:16:48,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:16:48,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:16:48,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:16:48,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-15 10:16:48,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:16:48,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:16:48,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:16:48,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:16:48,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-15 10:16:48,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:48,768 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-15 10:16:48,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 46 [2023-02-15 10:16:48,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:48,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:48,853 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-15 10:16:48,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2023-02-15 10:16:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:49,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:49,051 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:49,051 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:49,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2023-02-15 10:16:49,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:49,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2023-02-15 10:16:49,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:49,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:49,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2023-02-15 10:16:49,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:16:49,426 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:16:49,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2023-02-15 10:16:49,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-02-15 10:16:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:16:49,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:37,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:37,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797389948] [2023-02-15 10:17:37,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:37,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630277489] [2023-02-15 10:17:37,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630277489] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:37,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:37,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-15 10:17:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997123743] [2023-02-15 10:17:37,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:37,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 10:17:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 10:17:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1848, Unknown=11, NotChecked=0, Total=2070 [2023-02-15 10:17:37,149 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:40,194 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse69 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse0 (< 2 c_~N~0)) (.cse1 (< .cse32 c_~N~0)) (.cse31 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (store .cse14 .cse15 1)) (.cse30 (+ .cse69 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (select .cse14 .cse15))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (= (select .cse14 .cse9) 1) (= .cse3 0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse29 (store .cse14 .cse30 1))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse28 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse21 (select .cse29 (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse22 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse28 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse23 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse21 .cse22))))) (let ((.cse25 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse16 .cse18 .cse21 .cse22)))) (store .cse24 .cse9 (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse25 .cse9))))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse16 .cse17 .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse21 .cse22))))))))))))) (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= (let ((.cse34 (select .cse14 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse34))))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse34 .cse35)))) (store .cse39 .cse9 (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse9))))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse33 .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))) .cse2) .cse0 (< .cse31 c_~N~0) (not .cse1)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse54 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse47 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse48 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse44 .cse47))))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse43 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 .cse44 .cse47)))) (store .cse49 .cse9 (+ (select .cse50 .cse9) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse41 .cse42 .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse47))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse32 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse68 (store .cse54 .cse30 1))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse67 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse55 (select .cse68 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse56 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse67 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse59))))) (let ((.cse64 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse57 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse63 (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse55 .cse56 .cse57 .cse59)))) (store .cse63 .cse9 (+ (select .cse64 .cse9) (select (select (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| .cse63) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse55 .cse56 .cse57 .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from false [2023-02-15 10:18:20,091 WARN L233 SmtUtils]: Spent 11.27s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:18:22,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:24,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:26,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:28,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:30,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:43,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:45,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:47,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:49,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:51,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:19:46,736 WARN L233 SmtUtils]: Spent 31.63s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:20:05,558 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:20:09,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:10,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:12,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:15,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:17,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:19,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:20,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:22,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:24,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:25,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:26,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:28,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:32,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:34,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:36,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:43,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:53,115 WARN L233 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:20:56,654 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse71 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse0 (< 2 c_~N~0)) (.cse1 (< .cse33 c_~N~0)) (.cse32 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (store .cse14 .cse15 1)) (.cse31 (+ .cse71 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (select .cse14 .cse15))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (<= c_~N~0 2) (= (select .cse14 .cse9) 1) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (and (= .cse3 (let ((.cse16 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (+ (select .cse14 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse14 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_57| 1)) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse30 (store .cse14 .cse31 1))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse29 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse22 (select .cse30 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse23 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse29 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse22 .cse23))))) (let ((.cse26 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse17 .cse19 .cse22 .cse23)))) (store .cse25 .cse9 (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse26 .cse9))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 .cse18 .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse22 .cse23))))))))))))) (< .cse32 ~N~0) (not (< .cse33 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (and (= .cse3 (let ((.cse34 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (+ (select .cse14 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse14 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_57| 1)))) (or (= (let ((.cse36 (select .cse14 .cse31))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse36))))) (let ((.cse42 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse37 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse41 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse36 .cse37)))) (store .cse41 .cse9 (+ (select (select (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse42 .cse9))))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse35 .cse36 .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))) .cse2) .cse0 (< .cse32 c_~N~0) (not .cse1)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse55 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (select .cse56 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse49 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse55 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse49))))) (let ((.cse52 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse47 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse44 .cse45 .cse46 .cse49)))) (store .cse51 .cse9 (+ (select .cse52 .cse9) (select (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse43 .cse44 .cse45 .cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45 .cse46 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse49))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse33 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse32 ~N~0) (not (< .cse33 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse70 (store .cse56 .cse31 1))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse70))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse69 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse57 (select .cse70 (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse58 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse61 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse69 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse64 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse61))))) (let ((.cse66 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse62 (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse65 (store .cse66 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse57 .cse58 .cse59 .cse61)))) (store .cse65 .cse9 (+ (select .cse66 .cse9) (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| .cse65) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse57 .cse58 .cse59 .cse60 .cse61 (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from false [2023-02-15 10:21:08,419 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse62 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (+ .cse62 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse18 .cse19))) (let ((.cse42 (+ .cse1 .cse35)) (.cse20 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse21 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse10 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (< 2 c_~N~0)) (.cse2 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (and (<= c_~N~0 2) (or (= .cse0 .cse1) .cse2) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse17 (store .cse18 .cse19 1))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse16 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse8 (select .cse17 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse9 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse5 .cse8 .cse9)))) (store .cse12 .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse13 .cse10))))))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8 .cse9))))))))))))) (< .cse20 ~N~0) (not (< .cse21 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse22 .cse2 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= .cse0 (let ((.cse33 (* |ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse28 (select .cse18 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse33 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse24 .cse28))))) (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse25 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse24 .cse25 .cse28)))) (store .cse30 .cse10 (+ (select .cse31 .cse10) (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse23 .cse24 .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse23 .cse24 .cse25 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse28))))))))))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) (or (= (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42)))) (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse36 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse35 .cse36)))) (store .cse40 .cse10 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse41 .cse10))))))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse34 .cse35 .cse36 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))))) .cse0) .cse22 (< .cse20 c_~N~0) (not (< .cse21 c_~N~0))) (= .cse1 2) (or .cse22 (= (let ((.cse47 (store .cse18 .cse19 .cse42))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))) .cse0)) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse20 ~N~0) (not (< .cse21 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse61 (store (store .cse18 (+ .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse19 1))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse60 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse48 (select .cse61 (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse49 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse60 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse55 (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse52))))) (let ((.cse57 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse50 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse53 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse48 .cse49 .cse50 .cse52)))) (store .cse56 .cse10 (+ (select .cse57 .cse10) (select (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse48 .cse49 .cse50 .cse51 .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (or (= .cse0 (let ((.cse66 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse67 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse66)))) (store .cse67 .cse10 (+ (select .cse18 .cse10) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse67) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse66)))))) .cse22 .cse2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (let ((.cse68 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (and (= (+ .cse1 1) (select .cse18 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* .cse1 2) (+ 1 (select .cse18 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))))) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_57| 1)))))))))) is different from false [2023-02-15 10:21:13,146 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse87 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse86 (+ .cse87 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse29 .cse86))) (let ((.cse14 (+ .cse3 .cse4))) (let ((.cse66 (store .cse29 .cse86 .cse14))) (let ((.cse30 (+ .cse87 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse66))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse34 (select .cse29 .cse30)) (.cse32 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse1 (< .cse32 c_~N~0)) (.cse41 (+ .cse3 .cse34)) (.cse31 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse60 (store .cse29 .cse86 1)) (.cse0 (< 2 c_~N~0)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse67 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse14)))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (<= c_~N~0 2) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse28 (store .cse29 .cse30 1))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse27 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse20 (select .cse28 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse21 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse20 .cse21))))) (let ((.cse24 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse17 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse15 .cse17 .cse20 .cse21)))) (store .cse23 .cse9 (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse24 .cse9))))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse15 .cse16 .cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse17 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse20 .cse21))))))))))))) (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse41)))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse34 .cse35)))) (store .cse39 .cse9 (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse9))))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse33 .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))) .cse2) .cse0 (< .cse31 c_~N~0) (not .cse1)) (= .cse3 2) (or .cse0 (= (let ((.cse46 (store .cse29 .cse30 .cse41))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse43 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse42 .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))) .cse2)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse60))) (let ((.cse59 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse50 (select .cse60 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse53 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse59 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse54 (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse53))))) (let ((.cse56 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse49 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse51 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (store .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse48 .cse49 .cse50 .cse53)))) (store .cse55 .cse9 (+ (select .cse56 .cse9) (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse47 .cse48 .cse49 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse49 .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse53))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse32 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (< 1 c_~N~0) (or (= .cse2 (let ((.cse65 (store .cse66 .cse30 (+ .cse34 .cse67)))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse65))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse64 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse61 (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse64)))))) .cse0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse81 (store .cse60 .cse30 1))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse80 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse68 (select .cse81 (+ .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse69 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse72 (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse80 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse75 (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69 .cse72))))) (let ((.cse77 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse70 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse73 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse68 .cse69 .cse70 .cse72)))) (store .cse76 .cse9 (+ (select .cse77 .cse9) (select (select (store .cse75 |c_ULTIMATE.start_main_~a~0#1.base| .cse76) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse71 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse68 .cse69 .cse70 .cse71 .cse72 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse69 .cse70 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (let ((.cse82 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (and (= (+ .cse3 1) (select .cse29 (+ .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* .cse3 2) (+ 1 (select .cse29 (+ .cse82 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))))) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_57| 1))))) (or .cse0 (= .cse2 (let ((.cse85 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse67 .cse85))))))))))))) is different from false