./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/indp5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:32:35,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:32:35,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:32:35,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:32:35,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:32:35,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:32:35,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:32:35,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:32:35,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:32:35,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:32:35,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:32:35,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:32:35,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:32:35,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:32:35,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:32:35,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:32:35,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:32:35,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:32:35,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:32:35,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:32:35,102 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:32:35,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:32:35,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:32:35,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:32:35,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:32:35,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:32:35,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:32:35,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:32:35,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:32:35,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:32:35,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:32:35,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:32:35,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:32:35,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:32:35,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:32:35,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:32:35,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:32:35,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:32:35,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:32:35,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:32:35,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:32:35,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:32:35,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:32:35,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:32:35,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:32:35,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:32:35,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:32:35,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:32:35,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:32:35,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:32:35,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:32:35,146 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:32:35,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:32:35,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:32:35,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:32:35,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:32:35,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:32:35,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:32:35,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:32:35,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:32:35,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:32:35,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:32:35,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:32:35,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:32:35,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:32:35,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:32:35,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:32:35,151 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:32:35,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:32:35,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:32:35,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b [2022-07-19 10:32:35,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:32:35,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:32:35,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:32:35,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:32:35,355 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:32:35,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp5.c [2022-07-19 10:32:35,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c57ed1ee/2f59cc897abf436f8be6844d1398c9cf/FLAGd2de88b8d [2022-07-19 10:32:35,823 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:32:35,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c [2022-07-19 10:32:35,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c57ed1ee/2f59cc897abf436f8be6844d1398c9cf/FLAGd2de88b8d [2022-07-19 10:32:35,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c57ed1ee/2f59cc897abf436f8be6844d1398c9cf [2022-07-19 10:32:35,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:32:35,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:32:35,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:32:35,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:32:35,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:32:35,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:32:35" (1/1) ... [2022-07-19 10:32:35,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0ec9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:35, skipping insertion in model container [2022-07-19 10:32:35,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:32:35" (1/1) ... [2022-07-19 10:32:35,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:32:35,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:32:36,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c[588,601] [2022-07-19 10:32:36,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:32:36,069 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:32:36,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c[588,601] [2022-07-19 10:32:36,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:32:36,092 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:32:36,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36 WrapperNode [2022-07-19 10:32:36,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:32:36,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:32:36,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:32:36,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:32:36,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,135 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-07-19 10:32:36,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:32:36,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:32:36,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:32:36,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:32:36,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:32:36,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:32:36,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:32:36,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:32:36,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (1/1) ... [2022-07-19 10:32:36,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:32:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:36,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:32:36,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:32:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:32:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:32:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:32:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:32:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:32:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:32:36,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:32:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:32:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:32:36,259 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:32:36,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:32:36,366 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:32:36,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:32:36,370 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 10:32:36,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:32:36 BoogieIcfgContainer [2022-07-19 10:32:36,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:32:36,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:32:36,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:32:36,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:32:36,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:32:35" (1/3) ... [2022-07-19 10:32:36,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f81942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:32:36, skipping insertion in model container [2022-07-19 10:32:36,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:32:36" (2/3) ... [2022-07-19 10:32:36,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f81942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:32:36, skipping insertion in model container [2022-07-19 10:32:36,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:32:36" (3/3) ... [2022-07-19 10:32:36,376 INFO L111 eAbstractionObserver]: Analyzing ICFG indp5.c [2022-07-19 10:32:36,385 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:32:36,385 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:32:36,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:32:36,419 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7689ad0f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d3ce3d7 [2022-07-19 10:32:36,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:32:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:32:36,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:36,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:36,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2022-07-19 10:32:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:36,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822883369] [2022-07-19 10:32:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:36,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:32:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:36,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:36,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822883369] [2022-07-19 10:32:36,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822883369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:32:36,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:32:36,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:32:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151431378] [2022-07-19 10:32:36,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:32:36,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:32:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:36,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:32:36,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:32:36,555 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:36,569 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-19 10:32:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:32:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-19 10:32:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:36,576 INFO L225 Difference]: With dead ends: 50 [2022-07-19 10:32:36,577 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 10:32:36,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:32:36,582 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:36,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:32:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 10:32:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 10:32:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-19 10:32:36,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2022-07-19 10:32:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:36,605 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-19 10:32:36,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-19 10:32:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:32:36,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:36,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:36,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:32:36,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2022-07-19 10:32:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:36,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970742224] [2022-07-19 10:32:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:36,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:32:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:36,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970742224] [2022-07-19 10:32:36,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970742224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:32:36,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:32:36,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:32:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237072686] [2022-07-19 10:32:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:32:36,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:32:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:32:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:32:36,704 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:36,773 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-07-19 10:32:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:32:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-19 10:32:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:36,774 INFO L225 Difference]: With dead ends: 49 [2022-07-19 10:32:36,774 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 10:32:36,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:32:36,775 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:36,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:32:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 10:32:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-19 10:32:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-19 10:32:36,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-07-19 10:32:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:36,781 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-19 10:32:36,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-19 10:32:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:32:36,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:36,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:36,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:32:36,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2022-07-19 10:32:36,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:36,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869052479] [2022-07-19 10:32:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:36,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:36,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50698766] [2022-07-19 10:32:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:36,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:36,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:36,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:32:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:32:36,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-19 10:32:36,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:37,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:32:37,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2022-07-19 10:32:37,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 99 [2022-07-19 10:32:37,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-19 10:32:37,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-19 10:32:37,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-19 10:32:37,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-19 10:32:37,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-19 10:32:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:37,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:32:43,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:32:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:43,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869052479] [2022-07-19 10:32:43,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:32:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50698766] [2022-07-19 10:32:43,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50698766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:32:43,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:32:43,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2022-07-19 10:32:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494590924] [2022-07-19 10:32:43,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:32:43,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:32:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:32:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=240, Unknown=1, NotChecked=0, Total=306 [2022-07-19 10:32:43,113 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:44,187 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2022-07-19 10:32:44,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:32:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-19 10:32:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:44,190 INFO L225 Difference]: With dead ends: 80 [2022-07-19 10:32:44,190 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 10:32:44,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=148, Invalid=501, Unknown=1, NotChecked=0, Total=650 [2022-07-19 10:32:44,192 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:44,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 248 Invalid, 0 Unknown, 48 Unchecked, 0.5s Time] [2022-07-19 10:32:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 10:32:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2022-07-19 10:32:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-07-19 10:32:44,203 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 27 [2022-07-19 10:32:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:44,216 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-19 10:32:44,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-07-19 10:32:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:32:44,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:44,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:44,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:32:44,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:44,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2022-07-19 10:32:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:44,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024519101] [2022-07-19 10:32:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:44,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64555608] [2022-07-19 10:32:44,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:32:44,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:44,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:44,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:32:44,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:32:44,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:32:44,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:32:44,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:32:44,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:32:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:32:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024519101] [2022-07-19 10:32:44,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:32:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64555608] [2022-07-19 10:32:44,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64555608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:32:44,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:32:44,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-19 10:32:44,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434891129] [2022-07-19 10:32:44,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:32:44,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:32:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:32:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:32:44,585 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:44,707 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2022-07-19 10:32:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:32:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:32:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:44,708 INFO L225 Difference]: With dead ends: 126 [2022-07-19 10:32:44,709 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 10:32:44,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:32:44,710 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:44,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 33 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:32:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 10:32:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2022-07-19 10:32:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-19 10:32:44,716 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2022-07-19 10:32:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:44,716 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-19 10:32:44,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-19 10:32:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:32:44,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:44,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:44,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:32:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:32:44,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2022-07-19 10:32:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:44,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596395787] [2022-07-19 10:32:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:44,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:44,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11426091] [2022-07-19 10:32:44,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:32:44,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:44,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:44,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:44,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:32:45,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:32:45,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:32:45,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:32:45,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:32:45,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:32:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:32:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:45,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596395787] [2022-07-19 10:32:45,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:32:45,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11426091] [2022-07-19 10:32:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11426091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:32:45,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:32:45,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-19 10:32:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232127927] [2022-07-19 10:32:45,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:32:45,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:32:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:45,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:32:45,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:32:45,103 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:45,205 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-19 10:32:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:32:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:32:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:45,206 INFO L225 Difference]: With dead ends: 58 [2022-07-19 10:32:45,206 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 10:32:45,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:32:45,208 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:45,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 18 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:32:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 10:32:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-19 10:32:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-19 10:32:45,212 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2022-07-19 10:32:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:45,212 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-19 10:32:45,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-19 10:32:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:32:45,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:45,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:45,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 10:32:45,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:45,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2022-07-19 10:32:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:45,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889824028] [2022-07-19 10:32:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:45,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:45,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288079587] [2022-07-19 10:32:45,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:32:45,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:45,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:45,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:45,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:32:45,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:32:45,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:32:45,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-19 10:32:45,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:45,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:32:45,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:45,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2022-07-19 10:32:45,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 99 [2022-07-19 10:32:45,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:45,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 9 [2022-07-19 10:32:45,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:45,672 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-19 10:32:45,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-19 10:32:45,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:45,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 116 [2022-07-19 10:32:45,792 INFO L356 Elim1Store]: treesize reduction 318, result has 10.2 percent of original size [2022-07-19 10:32:45,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 105 treesize of output 160 [2022-07-19 10:32:45,813 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 10:32:45,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:45,906 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 10:32:45,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-19 10:32:46,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-07-19 10:32:46,050 INFO L356 Elim1Store]: treesize reduction 318, result has 10.2 percent of original size [2022-07-19 10:32:46,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 101 treesize of output 156 [2022-07-19 10:32:46,057 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 10:32:46,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,132 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 10:32:46,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-19 10:32:46,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-07-19 10:32:46,288 INFO L356 Elim1Store]: treesize reduction 326, result has 7.9 percent of original size [2022-07-19 10:32:46,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 101 treesize of output 148 [2022-07-19 10:32:46,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,384 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 10:32:46,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-19 10:32:46,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,464 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-07-19 10:32:46,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 86 [2022-07-19 10:32:46,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,539 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-07-19 10:32:46,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 86 [2022-07-19 10:32:46,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:46,713 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-19 10:32:46,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2022-07-19 10:32:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:46,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:33:40,926 WARN L233 SmtUtils]: Spent 14.44s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:33:49,580 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 1 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (<= 2 (let ((.cse7 (let ((.cse9 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (* .cse9 .cse9)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod .cse9 4294967296) 8)) (let ((.cse10 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (* .cse10 .cse10)))))) (let ((.cse3 (select .cse7 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (select .cse7 .cse6))) (store (store (store (store (store (store .cse7 |ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse6 (+ (- 1) .cse8)) |ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse6 (+ .cse8 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse6 (+ .cse8 (- 3))))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))))))))) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse19 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (<= (let ((.cse16 (let ((.cse18 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (* .cse18 .cse18)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod .cse18 4294967296) 8)) (* .cse19 .cse19))))) (let ((.cse12 (select .cse16 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (select .cse16 .cse15))) (store (store (store (store (store (store .cse16 |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse15 (+ (- 1) .cse17)) |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse15 (+ .cse17 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse15 (+ .cse17 (- 3))))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))))))) .cse19))) .cse1))) (or (and (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (<= 2 (let ((.cse25 (let ((.cse27 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368)) (* .cse27 .cse27)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod .cse27 4294967296) 8)) (let ((.cse28 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (* .cse28 .cse28)))))) (let ((.cse23 (select .cse25 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse26 (select .cse25 .cse24))) (store (store (store (store (store (store .cse25 |ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse24 (+ (- 1) .cse26)) |ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse24 (+ .cse26 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse24 (+ .cse26 (- 3))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) .cse22 .cse23)))))))) .cse1) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse37 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (<= (let ((.cse34 (let ((.cse36 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368)) (* .cse36 .cse36)) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod .cse36 4294967296) 8)) (* .cse37 .cse37))))) (let ((.cse32 (select .cse34 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse33))) (store (store (store (store (store (store .cse34 |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33 (+ (- 1) .cse35)) |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33 (+ .cse35 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33 (+ .cse35 (- 3))))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse33) .cse31 .cse32)))))) .cse37))) .cse1)) .cse0))) is different from true [2022-07-19 10:33:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 10:33:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:33:49,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889824028] [2022-07-19 10:33:49,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:33:49,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288079587] [2022-07-19 10:33:49,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288079587] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:33:49,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:33:49,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2022-07-19 10:33:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610247188] [2022-07-19 10:33:49,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:33:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-19 10:33:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:33:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-19 10:33:49,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1618, Unknown=2, NotChecked=82, Total=1892 [2022-07-19 10:33:49,594 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 44 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 44 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:45,798 WARN L233 SmtUtils]: Spent 15.21s on a formula simplification. DAG size of input: 225 DAG size of output: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:35:00,608 WARN L233 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 124 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:35:38,836 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 205 DAG size of output: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:35:41,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:35:43,842 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse74 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse73 (mod .cse2 4294967296)) (.cse63 (* .cse74 8))) (let ((.cse62 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse37 (<= .cse74 2147483647)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse64 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (<= .cse73 2147483647)) (.cse71 (* .cse2 .cse2)) (.cse72 (* .cse73 8))) (let ((.cse23 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse13 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (* (- 1) .cse71)) (.cse15 (not .cse16)) (.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse69 (store .cse44 .cse64 .cse71))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (select .cse69 .cse9))) (store (store (store (store (store (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 1) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 2) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse67) .cse9 (+ (- 3) .cse70)))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse67 .cse68))))))) (.cse3 (< 2 c_~N~0)) (.cse4 (not .cse37)) (.cse12 (store .cse44 .cse64 (+ .cse62 (select .cse44 .cse64)))) (.cse30 (let ((.cse61 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse44 .cse61 (+ .cse62 (select .cse44 .cse61)))))) (and (or .cse0 (<= .cse1 .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (or .cse3 (and (or .cse4 (and (or (= c_~N~0 (let ((.cse10 (store .cse12 .cse13 (+ (select .cse12 .cse13) .cse14)))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (select .cse10 .cse9))) (store (store (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) .cse9 (+ (- 1) .cse11)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) .cse9 (+ (- 2) .cse11)))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))) .cse15) (or .cse16 (= c_~N~0 (let ((.cse21 (store .cse12 .cse23 (+ .cse14 (select .cse12 .cse23))))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (select .cse21 .cse9))) (store (store (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) .cse9 (+ .cse22 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) .cse9 (+ .cse22 (- 2))))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse20)))))))))) (or (and (or .cse16 (= c_~N~0 (let ((.cse28 (store .cse30 .cse23 (+ (select .cse30 .cse23) .cse14)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse29 (select .cse28 .cse9))) (store (store (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) .cse9 (+ (- 1) .cse29)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) .cse9 (+ (- 2) .cse29)))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse27)))))))) (or (= c_~N~0 (let ((.cse35 (store .cse30 .cse13 (+ (select .cse30 .cse13) .cse14)))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (select .cse35 .cse9))) (store (store (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse9 (+ (- 1) .cse36)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse9 (+ (- 2) .cse36)))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse34))))))) .cse15)) .cse37))) (or (and (or .cse16 (= (let ((.cse42 (store .cse44 .cse23 (+ .cse14 (select .cse44 .cse23))))) (let ((.cse38 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (select .cse42 .cse9))) (store (store (store (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse9 (+ (- 1) .cse43)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse9 (+ (- 2) .cse43)))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse38 .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))) c_~N~0)) (or (= (let ((.cse49 (store .cse44 .cse13 (+ (select .cse44 .cse13) .cse14)))) (let ((.cse45 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (select .cse49 .cse9))) (store (store (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse9 (+ (- 1) .cse50)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse9 (+ (- 2) .cse50)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse48)))))) c_~N~0) .cse15)) .cse3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (< 1 c_~N~0) (or .cse0 (<= 2 .cse1)) (= (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or .cse3 (and (or .cse4 (= (let ((.cse51 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (select .cse12 .cse9))) (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse9 (+ (- 1) .cse55)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse9 (+ (- 2) .cse55)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse54))))) c_~N~0)) (or .cse37 (= (let ((.cse59 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (select .cse30 .cse9))) (store (store (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse9 (+ (- 1) .cse60)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse59) .cse9 (+ (- 2) .cse60)))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse59))))) c_~N~0)))) (= (select .cse44 .cse9) 3)))))) is different from true [2022-07-19 10:35:45,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:36:03,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:36:14,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:36:16,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:36:22,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:36:25,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:36:27,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:37:02,357 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 226 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:37:04,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:37:06,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-19 10:37:08,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []