./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 b5317dae 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-?-b5317da-m [2023-02-16 00:37:33,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:37:33,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:37:33,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:37:33,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:37:33,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:37:33,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:37:33,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:37:33,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:37:33,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:37:33,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:37:33,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:37:33,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:37:33,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:37:33,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:37:33,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:37:33,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:37:33,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:37:33,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:37:33,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:37:33,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:37:33,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:37:33,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:37:33,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:37:33,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:37:33,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:37:33,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:37:33,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:37:33,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:37:33,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:37:33,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:37:33,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:37:33,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:37:33,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:37:33,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:37:33,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:37:33,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:37:33,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:37:33,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:37:33,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:37:33,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:37:33,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:37:33,552 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:37:33,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:37:33,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:37:33,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:37:33,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:37:33,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:37:33,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:37:33,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:37:33,554 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:37:33,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:37:33,554 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:37:33,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:37:33,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:37:33,556 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:37:33,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:37:33,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:37:33,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:37:33,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:37:33,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:37:33,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:37:33,557 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:37:33,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:37:33,558 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:37:33,558 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-16 00:37:33,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:37:33,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:37:33,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:37:33,731 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:37:33,731 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:37:33,732 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-16 00:37:34,753 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:37:34,889 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:37:34,889 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss1.c [2023-02-16 00:37:34,893 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30064eec/4e158d11f5694145988b89e4be081694/FLAG1b7b3cf49 [2023-02-16 00:37:34,902 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30064eec/4e158d11f5694145988b89e4be081694 [2023-02-16 00:37:34,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:37:34,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:37:34,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:37:34,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:37:34,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:37:34,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:37:34" (1/1) ... [2023-02-16 00:37:34,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4048c75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:34, skipping insertion in model container [2023-02-16 00:37:34,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:37:34" (1/1) ... [2023-02-16 00:37:34,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:37:34,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:37:35,007 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-16 00:37:35,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:37:35,044 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:37:35,055 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-16 00:37:35,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:37:35,078 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:37:35,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35 WrapperNode [2023-02-16 00:37:35,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:37:35,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:37:35,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:37:35,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:37:35,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,113 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-02-16 00:37:35,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:37:35,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:37:35,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:37:35,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:37:35,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,146 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:37:35,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:37:35,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:37:35,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:37:35,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (1/1) ... [2023-02-16 00:37:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:37:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:35,176 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-16 00:37:35,181 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-16 00:37:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:37:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:37:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:37:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:37:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:37:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:37:35,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:37:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:37:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:37:35,271 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:37:35,273 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:37:35,442 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:37:35,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:37:35,446 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 00:37:35,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:37:35 BoogieIcfgContainer [2023-02-16 00:37:35,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:37:35,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:37:35,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:37:35,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:37:35,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:37:34" (1/3) ... [2023-02-16 00:37:35,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0214b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:37:35, skipping insertion in model container [2023-02-16 00:37:35,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:37:35" (2/3) ... [2023-02-16 00:37:35,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0214b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:37:35, skipping insertion in model container [2023-02-16 00:37:35,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:37:35" (3/3) ... [2023-02-16 00:37:35,468 INFO L112 eAbstractionObserver]: Analyzing ICFG ss1.c [2023-02-16 00:37:35,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:37:35,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:37:35,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:37:35,540 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;@7d6e9386, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:37:35,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:37:35,543 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-16 00:37:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 00:37:35,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:35,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:37:35,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2023-02-16 00:37:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:35,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956113328] [2023-02-16 00:37:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:35,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:35,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956113328] [2023-02-16 00:37:35,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-16 00:37:35,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421422378] [2023-02-16 00:37:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:35,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:35,688 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-16 00:37:35,719 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-16 00:37:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:35,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 00:37:35,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:35,771 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-16 00:37:35,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:37:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421422378] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:37:35,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:37:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:37:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336421222] [2023-02-16 00:37:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:37:35,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:37:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:37:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:37:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:37:35,798 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-16 00:37:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:35,808 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-02-16 00:37:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:37:35,809 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-16 00:37:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:35,815 INFO L225 Difference]: With dead ends: 44 [2023-02-16 00:37:35,815 INFO L226 Difference]: Without dead ends: 20 [2023-02-16 00:37:35,817 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-16 00:37:35,819 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-16 00:37:35,820 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-16 00:37:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-16 00:37:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-16 00:37:35,838 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-16 00:37:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-16 00:37:35,839 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2023-02-16 00:37:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:35,840 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-16 00:37:35,840 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-16 00:37:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-16 00:37:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 00:37:35,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:35,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:37:35,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:37:36,046 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-16 00:37:36,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2023-02-16 00:37:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:36,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263460127] [2023-02-16 00:37:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:36,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263460127] [2023-02-16 00:37:36,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-16 00:37:36,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190896459] [2023-02-16 00:37:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:36,114 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-16 00:37:36,116 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-16 00:37:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:36,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:37:36,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:36,243 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-16 00:37:36,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:37:36,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190896459] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:37:36,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:37:36,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:37:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206552748] [2023-02-16 00:37:36,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:37:36,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:37:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:37:36,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:37:36,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:37:36,246 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-16 00:37:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:36,280 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-02-16 00:37:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:37:36,281 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-16 00:37:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:36,282 INFO L225 Difference]: With dead ends: 41 [2023-02-16 00:37:36,282 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 00:37:36,282 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-16 00:37:36,283 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-16 00:37:36,283 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-16 00:37:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 00:37:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-02-16 00:37:36,287 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-16 00:37:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-16 00:37:36,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2023-02-16 00:37:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:36,288 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-16 00:37:36,288 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-16 00:37:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-16 00:37:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 00:37:36,288 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:36,288 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-16 00:37:36,295 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-16 00:37:36,493 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-16 00:37:36,494 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:36,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2023-02-16 00:37:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:36,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314700298] [2023-02-16 00:37:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:36,520 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:37:36,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849459666] [2023-02-16 00:37:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:36,522 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-16 00:37:36,524 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-16 00:37:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:36,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-16 00:37:36,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:36,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-16 00:37:36,614 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-16 00:37:36,633 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-16 00:37:36,730 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-16 00:37:36,797 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-16 00:37:36,876 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 42 treesize of output 25 [2023-02-16 00:37:36,934 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 59 treesize of output 39 [2023-02-16 00:37:36,950 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-16 00:37:36,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:37:37,376 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:37,409 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-16 00:37:37,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314700298] [2023-02-16 00:37:37,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:37:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849459666] [2023-02-16 00:37:37,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849459666] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:37:37,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:37:37,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-02-16 00:37:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363231833] [2023-02-16 00:37:37,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:37:37,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 00:37:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:37:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 00:37:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-02-16 00:37:37,412 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 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-16 00:37:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:42,127 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-02-16 00:37:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:37:42,128 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 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-16 00:37:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:42,128 INFO L225 Difference]: With dead ends: 51 [2023-02-16 00:37:42,128 INFO L226 Difference]: Without dead ends: 41 [2023-02-16 00:37:42,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 00:37:42,130 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:42,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 65 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:37:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-16 00:37:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2023-02-16 00:37:42,136 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-16 00:37:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-02-16 00:37:42,137 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2023-02-16 00:37:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:42,137 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-02-16 00:37:42,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 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-16 00:37:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-02-16 00:37:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:37:42,138 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:42,138 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-16 00:37:42,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:37:42,338 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-16 00:37:42,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2023-02-16 00:37:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:42,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124129735] [2023-02-16 00:37:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:42,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:37:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412143701] [2023-02-16 00:37:42,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:37:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:42,383 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-16 00:37:42,384 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-16 00:37:42,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:37:42,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:37:42,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:37:42,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:42,471 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-16 00:37:42,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:37:42,500 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-16 00:37:42,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124129735] [2023-02-16 00:37:42,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:37:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412143701] [2023-02-16 00:37:42,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412143701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:37:42,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:37:42,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-16 00:37:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398605721] [2023-02-16 00:37:42,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:37:42,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:37:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:37:42,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:37:42,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:37:42,503 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-16 00:37:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:42,593 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-02-16 00:37:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:37:42,594 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-16 00:37:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:42,595 INFO L225 Difference]: With dead ends: 80 [2023-02-16 00:37:42,595 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 00:37:42,595 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-16 00:37:42,596 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:42,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:37:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 00:37:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2023-02-16 00:37:42,602 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-16 00:37:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-16 00:37:42,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2023-02-16 00:37:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:42,602 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-16 00:37:42,603 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-16 00:37:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-16 00:37:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:37:42,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:42,603 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-16 00:37:42,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:37:42,808 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-16 00:37:42,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash 119582130, now seen corresponding path program 3 times [2023-02-16 00:37:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:42,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191671612] [2023-02-16 00:37:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:42,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:37:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040727092] [2023-02-16 00:37:42,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:37:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:42,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:42,847 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-16 00:37:42,849 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-16 00:37:42,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:37:42,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:37:42,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:37:42,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:42,936 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-16 00:37:42,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:37:42,968 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-16 00:37:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:42,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191671612] [2023-02-16 00:37:42,968 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:37:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040727092] [2023-02-16 00:37:42,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040727092] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:37:42,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:37:42,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-16 00:37:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029672131] [2023-02-16 00:37:42,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:37:42,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:37:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:37:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:37:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:37:42,970 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-16 00:37:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:43,064 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-02-16 00:37:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:37:43,064 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-16 00:37:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:43,065 INFO L225 Difference]: With dead ends: 47 [2023-02-16 00:37:43,065 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 00:37:43,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:37:43,066 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:43,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 20 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:37:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 00:37:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-16 00:37:43,070 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-16 00:37:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-16 00:37:43,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2023-02-16 00:37:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:43,071 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-16 00:37:43,071 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-16 00:37:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-16 00:37:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:37:43,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:43,072 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-16 00:37:43,077 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-16 00:37:43,276 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-16 00:37:43,277 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2023-02-16 00:37:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:43,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817518272] [2023-02-16 00:37:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:43,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:37:43,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915040489] [2023-02-16 00:37:43,295 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:37:43,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:43,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:43,296 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-16 00:37:43,298 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-16 00:37:43,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:37:43,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:37:43,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-16 00:37:43,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:43,370 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-16 00:37:43,374 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-16 00:37:43,384 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-16 00:37:43,425 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-16 00:37:43,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:43,558 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 00:37:43,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2023-02-16 00:37:43,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:43,636 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-02-16 00:37:43,636 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 65 treesize of output 65 [2023-02-16 00:37:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:43,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:43,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:43,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:43,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:43,824 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 43 [2023-02-16 00:37:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:43,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:43,916 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:43,917 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 71 treesize of output 41 [2023-02-16 00:37:44,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:44,111 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:44,112 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 69 treesize of output 43 [2023-02-16 00:37:44,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:44,228 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 51 treesize of output 37 [2023-02-16 00:37:44,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:44,304 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 60 treesize of output 38 [2023-02-16 00:37:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:37:44,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:37:50,967 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-16 00:37:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817518272] [2023-02-16 00:37:50,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:37:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915040489] [2023-02-16 00:37:50,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915040489] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:37:50,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:37:50,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-02-16 00:37:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960343850] [2023-02-16 00:37:50,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:37:50,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-16 00:37:50,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:37:50,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 00:37:50,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1986, Unknown=0, NotChecked=0, Total=2256 [2023-02-16 00:37:50,976 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 48 states, 48 states have (on average 1.1875) internal successors, (57), 48 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-16 00:38:06,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse76 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse25 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse77 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse76))) (let ((.cse4 (select .cse25 .cse77)) (.cse3 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse41 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse18 (< .cse40 c_~N~0)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3))))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse39 (store .cse25 .cse77 1)) (.cse0 (not .cse18)) (.cse1 (< .cse41 c_~N~0)) (.cse2 (< 2 c_~N~0)) (.cse17 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse76 8))) (and (or .cse0 .cse1 .cse2 (= (let ((.cse8 (select .cse15 .cse16))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))))) (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| (+ .cse4 .cse3 .cse5 .cse8)))) (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 ((.cse9 (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| (+ .cse4 .cse3 .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8 .cse9)))))))) .cse17)) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse18 (= (let ((.cse20 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse3 .cse20)))) (store .cse24 .cse10 (+ (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 .cse15 .cse10))))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse19 .cse3 .cse4 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse19 .cse3 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))) .cse17) .cse2) (exists ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse26 (* |v_ULTIMATE.start_main_~i~0#1_55| 8))) (and (= (select .cse25 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse26)) 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_55| 1)) (= (select .cse25 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse26 (- 8))) 1) (< |v_ULTIMATE.start_main_~i~0#1_55| c_~N~0)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((~N~0 Int)) (or (not (< 1 ~N~0)) (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse34 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse33 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse27 .cse28 .cse29 .cse33)))) (store .cse35 .cse10 (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse36 .cse10))))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse32 .cse33))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (< .cse40 ~N~0))) (forall ((~N~0 Int)) (or (< .cse41 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (= (let ((.cse54 (store .cse39 .cse16 1))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse49 (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse47 .cse48))))) (let ((.cse51 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse46 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (store .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse43 .cse46 .cse47 .cse48)))) (store .cse50 .cse10 (+ (select .cse51 .cse10) (select (select (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~#sum~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 .cse46 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse46 .cse47 .cse48)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< .cse40 ~N~0)))) (= (+ (select .cse25 .cse10) (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3) (or .cse0 .cse1 .cse2 (= (let ((.cse56 (select .cse25 .cse16))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse56))))) (let ((.cse62 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse55 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse58 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse61 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse55 .cse56)))) (store .cse61 .cse10 (+ (select .cse62 .cse10) (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse55 .cse56 .cse57 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse55 .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))))))) .cse17)) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (forall ((~N~0 Int)) (or (< .cse41 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (not (< .cse40 ~N~0)) (= (let ((.cse75 (store .cse25 .cse16 1))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse75))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse66 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse63 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse70 (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse66))))) (let ((.cse72 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse65 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse67 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse71 (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66)))) (store .cse71 .cse10 (+ (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse71) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse72 .cse10))))))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse63 .cse64 .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse69)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))))))))))) is different from false [2023-02-16 00:38:12,558 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse88 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse37 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse89 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse88))) (let ((.cse18 (select .cse37 .cse89)) (.cse52 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse61 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse30 (< .cse52 c_~N~0)) (.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse1))))) (let ((.cse27 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (< 1 c_~N~0)) (.cse16 (not .cse30)) (.cse17 (< .cse61 c_~N~0)) (.cse15 (< 2 c_~N~0)) (.cse29 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse13 (+ .cse1 .cse4 .cse5)) (.cse14 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0))) (.cse51 (store .cse37 .cse89 1)) (.cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse88 8))) (and (or (not .cse0) (= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse4 .cse5)))) (store .cse10 .cse8 (+ (select .cse11 .cse8) (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse2 .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| (+ .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) .cse14) .cse15) (or .cse16 .cse17 .cse15 (= (let ((.cse22 (select .cse27 .cse28))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse1 .cse22))))) (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| (+ .cse18 .cse1 .cse19 .cse22)))) (store .cse25 .cse8 (+ (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 .cse8))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse18 .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse1 .cse19 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse22 .cse23)))))))) .cse14)) (or (not .cse29) .cse30 (= (let ((.cse32 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse33 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse1 .cse32)))) (store .cse36 .cse8 (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse27 .cse8))))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse31 .cse1 .cse18 .cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse31 .cse1 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))) .cse14) .cse15) (exists ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse38 (* |v_ULTIMATE.start_main_~i~0#1_55| 8))) (and (= (select .cse37 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse38)) 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_55| 1)) (= (select .cse37 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse38 (- 8))) 1) (< |v_ULTIMATE.start_main_~i~0#1_55| c_~N~0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse0 (forall ((~N~0 Int)) (or (not (< 1 ~N~0)) (= (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse41 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse46 (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))))) (let ((.cse48 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse39 .cse40 .cse41 .cse45)))) (store .cse47 .cse8 (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse48 .cse8))))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse39 .cse40 .cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse44 .cse45))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (< .cse52 ~N~0))) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (or .cse16 .cse17 .cse15 (= (let ((.cse54 (select .cse37 .cse28))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse54))))) (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse56 (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse53 .cse54)))) (store .cse59 .cse8 (+ (select .cse60 .cse8) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse53 .cse54 .cse55 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))))))) .cse14)) (or .cse29 (= .cse13 .cse14)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (+ (select .cse37 .cse8) .cse4) .cse1) (forall ((~N~0 Int)) (or (< .cse61 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (= (let ((.cse74 (store .cse51 .cse28 1))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse74))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse67 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse68 (select (select (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse69 (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse67 .cse68))))) (let ((.cse71 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse66 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (store .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse63 .cse66 .cse67 .cse68)))) (store .cse70 .cse8 (+ (select .cse71 .cse8) (select (select (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |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 ((.cse62 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse62 .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63 .cse66 .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse66 .cse67 .cse68)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< .cse52 ~N~0)))) (forall ((~N~0 Int)) (or (< .cse61 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (not (< .cse52 ~N~0)) (= (let ((.cse87 (store .cse37 .cse28 1))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse87))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse75 (select (select (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse82 (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse86 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse78))))) (let ((.cse84 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse77 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse79 (store .cse82 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse83 (store .cse84 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78)))) (store .cse83 .cse8 (+ (select (select (store .cse82 |c_ULTIMATE.start_main_~a~0#1.base| .cse83) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse84 .cse8))))))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse75 .cse76 .cse77 .cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse81)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))))))))))) is different from false [2023-02-16 00:38:27,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:38:52,386 WARN L233 SmtUtils]: Spent 16.37s on a formula simplification. DAG size of input: 134 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:39:15,746 WARN L233 SmtUtils]: Spent 11.84s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:39:19,922 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse94 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse92 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse94))) (let ((.cse4 (select .cse26 .cse92)) (.cse3 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse93 (+ .cse4 .cse3))) (let ((.cse55 (store .cse26 .cse92 .cse93))) (let ((.cse40 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55)) (.cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse94 8))) (let ((.cse42 (select .cse26 .cse16)) (.cse60 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse18 (< .cse40 c_~N~0)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse93)))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (not .cse18)) (.cse2 (< 2 c_~N~0)) (.cse56 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse39 (store .cse26 .cse92 1)) (.cse1 (< .cse60 c_~N~0)) (.cse49 (+ .cse3 .cse42)) (.cse17 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (and (or .cse0 .cse1 .cse2 (= (let ((.cse8 (select .cse15 .cse16))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))))) (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| (+ .cse4 .cse3 .cse5 .cse8)))) (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 ((.cse9 (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| (+ .cse4 .cse3 .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8 .cse9)))))))) .cse17)) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse18 (= (let ((.cse20 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse3 .cse20)))) (store .cse24 .cse10 (+ (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 .cse15 .cse10))))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse19 .cse3 .cse4 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse19 .cse3 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))) .cse17) .cse2) (exists ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse25 (select .cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_55| 8))))) (and (= 3 .cse25) (= (+ .cse3 1) .cse25) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_55| 1)) (< |v_ULTIMATE.start_main_~i~0#1_55| c_~N~0) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse25)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 c_~N~0) (forall ((~N~0 Int)) (or (not (< 1 ~N~0)) (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse29 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse34 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29))))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse33 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse27 .cse28 .cse29 .cse33)))) (store .cse35 .cse10 (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse36 .cse10))))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse32 .cse33))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (< .cse40 ~N~0))) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (or .cse0 .cse1 .cse2 (= (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse49)))) (let ((.cse48 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse41 .cse42)))) (store .cse47 .cse10 (+ (select .cse48 .cse10) (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse41 .cse42 .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse41 .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))))) .cse17)) (<= c_~N~0 2) (or .cse1 (= (let ((.cse54 (store .cse55 .cse16 (+ .cse42 .cse56)))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse53 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse52 .cse53))))) .cse17)) (or .cse18 (= (let ((.cse57 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse57 .cse56 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) .cse17)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (forall ((~N~0 Int)) (or (< .cse60 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (= (let ((.cse73 (store .cse39 .cse16 1))) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse73))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse66 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse67 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse68 (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse66 .cse67))))) (let ((.cse70 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse65 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse63 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse69 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse62 .cse65 .cse66 .cse67)))) (store .cse69 .cse10 (+ (select .cse70 .cse10) (select (select (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| .cse69) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse64 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse61 .cse62 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse65 .cse66 .cse67))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse65 .cse66 .cse67)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< .cse40 ~N~0)))) (or .cse1 (= (let ((.cse78 (store .cse26 .cse16 .cse49))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse78))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse77 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse76 .cse77))))) .cse17)) (forall ((~N~0 Int)) (or (< .cse60 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (not (< .cse40 ~N~0)) (= (let ((.cse91 (store .cse26 .cse16 1))) (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse91))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse82 (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse86 (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse82))))) (let ((.cse88 (select .cse86 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse81 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse83 (store .cse86 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse87 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse79 .cse80 .cse81 .cse82)))) (store .cse87 .cse10 (+ (select (select (store .cse86 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse10))))))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse79 .cse80 .cse81 .cse82 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse82 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse85)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0)))))))))))))) is different from true [2023-02-16 00:39:30,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:39:48,746 WARN L233 SmtUtils]: Spent 6.83s 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-16 00:40:11,186 WARN L233 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 112 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:40:32,986 WARN L233 SmtUtils]: Spent 6.38s 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-16 00:41:11,558 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 223 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:42:13,165 WARN L233 SmtUtils]: Spent 38.86s on a formula simplification. DAG size of input: 150 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:42:15,208 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse76 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse77 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse76))) (let ((.cse4 (select .cse61 .cse77)) (.cse3 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse38 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse39 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse18 (< .cse38 c_~N~0)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3))))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse37 (store .cse61 .cse77 1)) (.cse0 (not .cse18)) (.cse1 (< .cse39 c_~N~0)) (.cse2 (< 2 c_~N~0)) (.cse17 (+ (* 2 c_~N~0) (* c_~N~0 c_~N~0))) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse76 8))) (and (or .cse0 .cse1 .cse2 (= (let ((.cse8 (select .cse15 .cse16))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))))) (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| (+ .cse4 .cse3 .cse5 .cse8)))) (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 ((.cse9 (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| (+ .cse4 .cse3 .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8 .cse9)))))))) .cse17)) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse18 (= (let ((.cse20 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse3 .cse20)))) (store .cse24 .cse10 (+ (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 .cse15 .cse10))))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse19 .cse3 .cse4 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse19 .cse3 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))) .cse17) .cse2) (< 1 c_~N~0) (forall ((~N~0 Int)) (or (not (< 1 ~N~0)) (= (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27))))) (let ((.cse34 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 .cse26 .cse27 .cse31)))) (store .cse33 .cse10 (+ (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse34 .cse10))))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse25 .cse26 .cse27 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse30 .cse31))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)) (< .cse38 ~N~0))) (= .cse3 8) (forall ((~N~0 Int)) (or (< .cse39 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (= (let ((.cse52 (store .cse37 .cse16 1))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse46 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse47 (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse45 .cse46))))) (let ((.cse49 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse41 .cse44 .cse45 .cse46)))) (store .cse48 .cse10 (+ (select .cse49 .cse10) (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse40 .cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse44 .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse44 .cse45 .cse46)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< .cse38 ~N~0)))) (or .cse0 .cse1 .cse2 (= (let ((.cse54 (select .cse61 .cse16))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse54))))) (let ((.cse60 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse56 (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse59 (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse53 .cse54)))) (store .cse59 .cse10 (+ (select .cse60 .cse10) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse53 .cse54 .cse55 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))))))) .cse17)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse62 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_55| 1)) (= (select .cse62 0) 3) (= (select .cse62 (* |v_ULTIMATE.start_main_~i~0#1_55| 8)) 3) (< |v_ULTIMATE.start_main_~i~0#1_55| c_~N~0) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (forall ((~N~0 Int)) (or (< .cse39 ~N~0) (not (< 1 ~N~0)) (< 2 ~N~0) (not (< .cse38 ~N~0)) (= (let ((.cse75 (store .cse61 .cse16 1))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse75))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse66 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse63 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse70 (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse66))))) (let ((.cse72 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse65 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse67 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse71 (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66)))) (store .cse71 .cse10 (+ (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse71) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse72 .cse10))))))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse63 .cse64 .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64 .cse65 .cse66 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse69)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))))) (<= c_~N~0 2))))))) is different from false