./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ss3.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 5805614faff907ef6adf6c59906ce41481de02c5b77e55fb631cc39640689370 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:17:26,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:17:26,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:17:27,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:17:27,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:17:27,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:17:27,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:17:27,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:17:27,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:17:27,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:17:27,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:17:27,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:17:27,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:17:27,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:17:27,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:17:27,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:17:27,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:17:27,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:17:27,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:17:27,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:17:27,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:17:27,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:17:27,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:17:27,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:17:27,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:17:27,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:17:27,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:17:27,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:17:27,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:17:27,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:17:27,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:17:27,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:17:27,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:17:27,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:17:27,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:17:27,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:17:27,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:17:27,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:17:27,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:17:27,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:17:27,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:17:27,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:17:27,094 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:17:27,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:17:27,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:17:27,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:17:27,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:17:27,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:17:27,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:17:27,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:17:27,096 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:17:27,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:17:27,097 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:17:27,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:17:27,098 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:17:27,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:17:27,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:17:27,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:17:27,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:17:27,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:17:27,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:17:27,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:17:27,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:17:27,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:17:27,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:17:27,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:17:27,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:17:27,101 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:17:27,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:17:27,101 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:17:27,101 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 -> 5805614faff907ef6adf6c59906ce41481de02c5b77e55fb631cc39640689370 [2023-02-15 10:17:27,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:17:27,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:17:27,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:17:27,304 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:17:27,304 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:17:27,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss3.c [2023-02-15 10:17:28,443 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:17:28,661 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:17:28,662 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss3.c [2023-02-15 10:17:28,668 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c6904ae/dd334ef4c6cb48689401586e61664d3f/FLAGc8409b7fa [2023-02-15 10:17:28,696 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c6904ae/dd334ef4c6cb48689401586e61664d3f [2023-02-15 10:17:28,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:17:28,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:17:28,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:17:28,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:17:28,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:17:28,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16efd1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28, skipping insertion in model container [2023-02-15 10:17:28,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:17:28,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:17:28,842 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/ss3.c[586,599] [2023-02-15 10:17:28,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:17:28,864 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:17:28,872 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/ss3.c[586,599] [2023-02-15 10:17:28,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:17:28,890 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:17:28,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28 WrapperNode [2023-02-15 10:17:28,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:17:28,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:17:28,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:17:28,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:17:28,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,915 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-02-15 10:17:28,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:17:28,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:17:28,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:17:28,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:17:28,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:17:28,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:17:28,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:17:28,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:17:28,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (1/1) ... [2023-02-15 10:17:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:17:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:28,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:17:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:17:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:17:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:17:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:17:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:17:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:17:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:17:29,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:17:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:17:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:17:29,082 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:17:29,083 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:17:29,197 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:17:29,202 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:17:29,202 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 10:17:29,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:17:29 BoogieIcfgContainer [2023-02-15 10:17:29,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:17:29,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:17:29,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:17:29,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:17:29,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:17:28" (1/3) ... [2023-02-15 10:17:29,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65181e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:17:29, skipping insertion in model container [2023-02-15 10:17:29,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:28" (2/3) ... [2023-02-15 10:17:29,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65181e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:17:29, skipping insertion in model container [2023-02-15 10:17:29,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:17:29" (3/3) ... [2023-02-15 10:17:29,209 INFO L112 eAbstractionObserver]: Analyzing ICFG ss3.c [2023-02-15 10:17:29,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:17:29,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:17:29,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:17:29,266 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;@67554681, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:17:29,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:17:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:17:29,286 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:29,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:29,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2023-02-15 10:17:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:29,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643059338] [2023-02-15 10:17:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:29,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643059338] [2023-02-15 10:17:29,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 10:17:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240536393] [2023-02-15 10:17:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:29,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:29,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:29,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:29,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:17:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:29,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:17:29,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:29,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:17:29,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240536393] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:17:29,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:17:29,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:17:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985925653] [2023-02-15 10:17:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:17:29,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:17:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:17:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:17:29,525 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:29,536 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-15 10:17:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:17:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 10:17:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:29,549 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:17:29,549 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 10:17:29,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:17:29,554 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:29,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:17:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 10:17:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 10:17:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 10:17:29,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2023-02-15 10:17:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:29,582 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 10:17:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 10:17:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:17:29,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:29,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:29,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:29,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 10:17:29,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2023-02-15 10:17:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:29,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137089975] [2023-02-15 10:17:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137089975] [2023-02-15 10:17:29,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 10:17:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957584262] [2023-02-15 10:17:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:29,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:29,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:29,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:29,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:17:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:29,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:17:29,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:29,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:17:29,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957584262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:17:29,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:17:29,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:17:29,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375092035] [2023-02-15 10:17:29,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:17:29,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:17:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:29,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:17:29,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:17:29,954 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:29,999 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-02-15 10:17:29,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:17:29,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 10:17:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:30,000 INFO L225 Difference]: With dead ends: 49 [2023-02-15 10:17:30,000 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 10:17:30,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:17:30,001 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:30,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:17:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 10:17:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-02-15 10:17:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-15 10:17:30,006 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2023-02-15 10:17:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:30,007 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-15 10:17:30,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-15 10:17:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:17:30,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:30,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:30,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:17:30,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-15 10:17:30,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:30,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2023-02-15 10:17:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:30,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268418377] [2023-02-15 10:17:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:30,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:30,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997106164] [2023-02-15 10:17:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:30,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:30,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:30,271 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:30,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:17:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:17:30,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 10:17:30,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:30,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:17:30,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:17:30,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:17:30,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:17:30,680 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 26 treesize of output 21 [2023-02-15 10:17:30,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:17:30,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:17:30,922 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 53 treesize of output 33 [2023-02-15 10:17:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:30,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:31,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:31,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268418377] [2023-02-15 10:17:31,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:31,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997106164] [2023-02-15 10:17:31,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997106164] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:31,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:31,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2023-02-15 10:17:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29821360] [2023-02-15 10:17:31,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:31,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 10:17:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 10:17:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2023-02-15 10:17:31,497 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:35,708 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2023-02-15 10:17:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 10:17:35,709 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 10:17:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:35,714 INFO L225 Difference]: With dead ends: 70 [2023-02-15 10:17:35,714 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 10:17:35,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2023-02-15 10:17:35,724 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 110 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:35,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 10:17:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 10:17:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2023-02-15 10:17:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-02-15 10:17:35,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 27 [2023-02-15 10:17:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:35,769 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-02-15 10:17:35,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-02-15 10:17:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:17:35,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:35,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:35,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:35,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:35,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2023-02-15 10:17:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:35,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862622006] [2023-02-15 10:17:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:36,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:36,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8154384] [2023-02-15 10:17:36,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:17:36,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:36,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:36,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:17:36,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:17:36,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:36,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:17:36,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:17:36,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:17:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862622006] [2023-02-15 10:17:36,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8154384] [2023-02-15 10:17:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8154384] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:36,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:17:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446527274] [2023-02-15 10:17:36,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:36,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:17:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:36,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:17:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:17:36,132 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:36,256 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2023-02-15 10:17:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:17:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:17:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:36,263 INFO L225 Difference]: With dead ends: 109 [2023-02-15 10:17:36,264 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 10:17:36,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:17:36,268 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:36,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:17:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 10:17:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2023-02-15 10:17:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-02-15 10:17:36,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2023-02-15 10:17:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:36,285 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-02-15 10:17:36,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-02-15 10:17:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:17:36,286 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:36,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:36,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 10:17:36,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:36,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2023-02-15 10:17:36,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:36,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955548345] [2023-02-15 10:17:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:36,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:36,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835206500] [2023-02-15 10:17:36,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:17:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:36,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:36,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:17:36,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:17:36,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:36,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:17:36,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:17:36,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:17:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:36,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955548345] [2023-02-15 10:17:36,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:36,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835206500] [2023-02-15 10:17:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835206500] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:36,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:36,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:17:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039267482] [2023-02-15 10:17:36,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:36,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:17:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:17:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:17:36,674 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:36,786 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-02-15 10:17:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:17:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:17:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:36,787 INFO L225 Difference]: With dead ends: 58 [2023-02-15 10:17:36,787 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 10:17:36,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 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-15 10:17:36,788 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:36,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 21 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:17:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 10:17:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-02-15 10:17:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-02-15 10:17:36,798 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2023-02-15 10:17:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:36,798 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-02-15 10:17:36,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-02-15 10:17:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:17:36,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:36,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:36,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:37,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:37,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2023-02-15 10:17:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:37,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181787203] [2023-02-15 10:17:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:37,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:37,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055054592] [2023-02-15 10:17:37,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:17:37,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:37,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:37,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:37,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:17:37,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:17:37,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:37,127 WARN L261 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-15 10:17:37,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:37,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:17:37,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:17:37,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:17:37,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,209 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:17:37,210 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 10:17:37,314 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:37,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,329 INFO L321 Elim1Store]: treesize reduction 63, result has 19.2 percent of original size [2023-02-15 10:17:37,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 42 [2023-02-15 10:17:37,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:37,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2023-02-15 10:17:37,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:37,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,547 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 10:17:37,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 46 [2023-02-15 10:17:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,624 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:17:37,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2023-02-15 10:17:37,720 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,734 INFO L321 Elim1Store]: treesize reduction 30, result has 33.3 percent of original size [2023-02-15 10:17:37,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 10:17:37,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2023-02-15 10:17:37,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:17:37,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:37,947 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 57 treesize of output 39 [2023-02-15 10:17:38,042 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2023-02-15 10:17:38,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 33 [2023-02-15 10:17:38,112 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:17:38,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 40 [2023-02-15 10:17:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:38,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:17:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181787203] [2023-02-15 10:17:48,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055054592] [2023-02-15 10:17:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055054592] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:48,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:48,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-02-15 10:17:48,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230386759] [2023-02-15 10:17:48,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:48,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 10:17:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:48,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 10:17:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 10:17:48,757 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 52 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:54,627 WARN L233 SmtUtils]: Spent 14.97s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:18:56,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:18:58,935 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse79 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse78 (+ .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (select .cse12 .cse78))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse21)))) (.cse32 (< .cse54 c_~N~0)) (.cse53 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (< .cse53 c_~N~0)) (.cse24 (not .cse32)) (.cse22 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ c_~N~0 (* c_~N~0 c_~N~0))) (.cse23 (+ .cse79 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse52 (store .cse12 .cse78 1))) (and (or (< 2 c_~N~0) (not (< 1 c_~N~0)) (= .cse0 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse11)))))) (let ((.cse8 (store (store (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (store .cse7 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4))))))))) (or .cse13 (= .cse0 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse21 (select .cse22 .cse23)))))) (let ((.cse20 (store (store (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17))) (store .cse19 .cse5 (select (select (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse16 .cse17)))))))) .cse24) (or .cse13 (= (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 (select .cse12 .cse23)))))) (let ((.cse31 (store (store (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse26 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| .cse26))) (store .cse30 .cse5 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse25 .cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) .cse0) .cse24) (or .cse32 (= (let ((.cse39 (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse35 (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35))) (store .cse38 .cse5 (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse35 .cse36)))))) .cse0) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (forall ((~N~0 Int)) (or (= (let ((.cse44 (let ((.cse51 (store .cse52 .cse23 1))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51))) (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse50 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse49 .cse50 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))))) (let ((.cse46 (store (store (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse40 (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse41 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse40))) (store .cse45 .cse5 (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse40 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse43))))))) (+ ~N~0 (* ~N~0 ~N~0))) (< .cse53 ~N~0) (not (< .cse54 ~N~0)) (not (< 1 ~N~0)) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (< .cse53 ~N~0) (not (< .cse54 ~N~0)) (not (< 1 ~N~0)) (= (let ((.cse59 (let ((.cse66 (store .cse12 .cse23 1))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse66))) (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse64 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse64 (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse65))))))))) (let ((.cse61 (store (store (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse56 (select (select (store .cse59 |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 ((.cse57 (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse56))) (store .cse60 .cse5 (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse55 .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (+ ~N~0 (* ~N~0 ~N~0))) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (= (let ((.cse71 (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52))) (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse76 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse76 (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|) .cse5) .cse77)))))))) (let ((.cse73 (store (store (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 0))) (let ((.cse67 (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse69 (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse72 (store .cse73 |c_ULTIMATE.start_main_~a~0#1.offset| .cse67))) (store .cse72 .cse5 (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse70 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse67 .cse68 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (+ ~N~0 (* ~N~0 ~N~0))) (not (< 1 ~N~0)) (< .cse54 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))))))))) is different from false [2023-02-15 10:19:02,132 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse58 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse15 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse14 (+ .cse58 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (store .cse29 (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse16 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse30 (+ c_~N~0 (* c_~N~0 c_~N~0))) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((~N~0 Int)) (or (= (let ((.cse5 (let ((.cse12 (store .cse13 .cse14 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse10 .cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))))) (let ((.cse7 (store (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse4 0))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0))) (store .cse6 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))))) (+ ~N~0 (* ~N~0 ~N~0))) (< .cse15 ~N~0) (not (< .cse16 ~N~0)) (not (< 1 ~N~0)) (< 2 ~N~0))) (forall ((~N~0 Int)) (or (< .cse15 ~N~0) (not (< .cse16 ~N~0)) (not (< 1 ~N~0)) (= (let ((.cse21 (let ((.cse28 (store .cse29 .cse14 1))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse26 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse27))))))))) (let ((.cse23 (store (store (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse4 0))) (let ((.cse18 (select (select (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse18))) (store .cse22 .cse4 (select (select (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (+ ~N~0 (* ~N~0 ~N~0))) (< 2 ~N~0))) (or (< 2 c_~N~0) (< .cse16 c_~N~0) (not (< 1 c_~N~0)) (= .cse30 (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse40))))))) (let ((.cse37 (store (store (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse4 0))) (let ((.cse31 (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31))) (store .cse36 .cse4 (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|)))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse34))))))))) (forall ((~N~0 Int)) (or (= (let ((.cse45 (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse51 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse50 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse51)))))))) (let ((.cse47 (store (store (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse4 0))) (let ((.cse41 (select (select (store .cse45 |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 ((.cse43 (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| .cse41))) (store .cse46 .cse4 (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (+ ~N~0 (* ~N~0 ~N~0))) (not (< 1 ~N~0)) (< .cse16 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= .cse30 (let ((.cse57 (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse4 0))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53))) (store .cse56 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse52 .cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))))))) is different from false [2023-02-15 10:20:01,781 WARN L233 SmtUtils]: Spent 25.97s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:20:18,349 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:20:50,597 WARN L233 SmtUtils]: Spent 11.87s on a formula simplification. DAG size of input: 227 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:20:55,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:20:58,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:21:16,684 WARN L233 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)