/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 00:19:15,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 00:19:15,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 00:19:15,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 00:19:15,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 00:19:15,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 00:19:15,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 00:19:15,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 00:19:15,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 00:19:15,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 00:19:15,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 00:19:15,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 00:19:15,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 00:19:15,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 00:19:15,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 00:19:15,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 00:19:15,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 00:19:15,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 00:19:15,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 00:19:15,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 00:19:15,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 00:19:15,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 00:19:15,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 00:19:15,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 00:19:15,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 00:19:15,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 00:19:15,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 00:19:15,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 00:19:15,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 00:19:15,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 00:19:15,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 00:19:15,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 00:19:15,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 00:19:15,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 00:19:15,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 00:19:15,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 00:19:15,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 00:19:15,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 00:19:15,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 00:19:15,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 00:19:15,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 00:19:15,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 00:19:15,300 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 00:19:15,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 00:19:15,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 00:19:15,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 00:19:15,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 00:19:15,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 00:19:15,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 00:19:15,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 00:19:15,302 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 00:19:15,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 00:19:15,303 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 00:19:15,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 00:19:15,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 00:19:15,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 00:19:15,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:19:15,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 00:19:15,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 00:19:15,306 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 00:19:15,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 00:19:15,306 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 00:19:15,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 00:19:15,306 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 00:19:15,306 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-03-31 00:19:15,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 00:19:15,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 00:19:15,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 00:19:15,521 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 00:19:15,522 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 00:19:15,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-03-31 00:19:16,654 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 00:19:16,854 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 00:19:16,854 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-03-31 00:19:16,859 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773f4d2e2/a513acf2d9f84fd68c7e19a5e417631a/FLAG881a98b96 [2023-03-31 00:19:16,877 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773f4d2e2/a513acf2d9f84fd68c7e19a5e417631a [2023-03-31 00:19:16,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 00:19:16,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 00:19:16,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 00:19:16,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 00:19:16,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 00:19:16,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:19:16" (1/1) ... [2023-03-31 00:19:16,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793c9ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:16, skipping insertion in model container [2023-03-31 00:19:16,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:19:16" (1/1) ... [2023-03-31 00:19:16,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 00:19:16,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 00:19:17,025 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-03-31 00:19:17,032 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-03-31 00:19:17,035 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-03-31 00:19:17,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:19:17,045 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 00:19:17,058 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-03-31 00:19:17,061 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-03-31 00:19:17,064 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-03-31 00:19:17,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:19:17,077 INFO L208 MainTranslator]: Completed translation [2023-03-31 00:19:17,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17 WrapperNode [2023-03-31 00:19:17,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 00:19:17,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 00:19:17,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 00:19:17,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 00:19:17,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,101 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 00:19:17,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 00:19:17,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 00:19:17,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 00:19:17,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (1/1) ... [2023-03-31 00:19:17,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:19:17,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:19:17,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-31 00:19:17,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-31 00:19:17,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 00:19:17,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 00:19:17,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 00:19:17,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-31 00:19:17,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 00:19:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 00:19:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-31 00:19:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 00:19:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 00:19:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 00:19:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 00:19:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 00:19:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 00:19:17,252 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 00:19:17,256 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 00:19:17,502 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 00:19:17,509 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 00:19:17,509 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-31 00:19:17,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:19:17 BoogieIcfgContainer [2023-03-31 00:19:17,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 00:19:17,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 00:19:17,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 00:19:17,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 00:19:17,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 12:19:16" (1/3) ... [2023-03-31 00:19:17,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eebb4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:19:17, skipping insertion in model container [2023-03-31 00:19:17,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:19:17" (2/3) ... [2023-03-31 00:19:17,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eebb4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:19:17, skipping insertion in model container [2023-03-31 00:19:17,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:19:17" (3/3) ... [2023-03-31 00:19:17,530 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2023-03-31 00:19:17,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 00:19:17,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-03-31 00:19:17,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 00:19:17,624 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23c41189, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 00:19:17,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-03-31 00:19:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 34 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-31 00:19:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-03-31 00:19:17,639 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:17,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:17,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:17,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1712545459, now seen corresponding path program 1 times [2023-03-31 00:19:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523634080] [2023-03-31 00:19:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:19:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523634080] [2023-03-31 00:19:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523634080] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:19:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:19:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183631257] [2023-03-31 00:19:17,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:17,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:19:17,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:17,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:19:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:19:17,995 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 34 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:18,195 INFO L93 Difference]: Finished difference Result 80 states and 113 transitions. [2023-03-31 00:19:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:19:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-03-31 00:19:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:18,205 INFO L225 Difference]: With dead ends: 80 [2023-03-31 00:19:18,205 INFO L226 Difference]: Without dead ends: 41 [2023-03-31 00:19:18,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:19:18,214 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:18,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:19:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-03-31 00:19:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2023-03-31 00:19:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 31 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-03-31 00:19:18,246 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 15 [2023-03-31 00:19:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:18,246 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-03-31 00:19:18,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-03-31 00:19:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-03-31 00:19:18,247 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:18,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:18,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 00:19:18,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:18,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -409026869, now seen corresponding path program 1 times [2023-03-31 00:19:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785628221] [2023-03-31 00:19:18,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:19:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:18,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785628221] [2023-03-31 00:19:18,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785628221] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:19:18,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851965912] [2023-03-31 00:19:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:18,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:19:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:19:18,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:19:18,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-31 00:19:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:18,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 00:19:18,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:19:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-31 00:19:18,575 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:19:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851965912] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 00:19:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-03-31 00:19:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359167802] [2023-03-31 00:19:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:18,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 00:19:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 00:19:18,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:19:18,587 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:18,600 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-03-31 00:19:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 00:19:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-03-31 00:19:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:18,604 INFO L225 Difference]: With dead ends: 42 [2023-03-31 00:19:18,604 INFO L226 Difference]: Without dead ends: 37 [2023-03-31 00:19:18,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:19:18,606 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:18,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:19:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-03-31 00:19:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-03-31 00:19:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-03-31 00:19:18,621 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2023-03-31 00:19:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:18,621 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-03-31 00:19:18,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-03-31 00:19:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-03-31 00:19:18,622 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:18,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:18,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-31 00:19:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:19:18,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:18,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1899205271, now seen corresponding path program 1 times [2023-03-31 00:19:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496533458] [2023-03-31 00:19:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:18,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-31 00:19:18,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:18,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496533458] [2023-03-31 00:19:18,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496533458] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:18,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:19:18,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 00:19:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79547929] [2023-03-31 00:19:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:18,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:19:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:19:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:19:18,931 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:19,029 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-03-31 00:19:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 00:19:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-03-31 00:19:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:19,030 INFO L225 Difference]: With dead ends: 55 [2023-03-31 00:19:19,030 INFO L226 Difference]: Without dead ends: 53 [2023-03-31 00:19:19,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 00:19:19,031 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:19,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 70 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:19:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-03-31 00:19:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2023-03-31 00:19:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-03-31 00:19:19,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 18 [2023-03-31 00:19:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:19,039 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-03-31 00:19:19,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-03-31 00:19:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-03-31 00:19:19,040 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:19,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:19,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 00:19:19,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:19,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1835482322, now seen corresponding path program 1 times [2023-03-31 00:19:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142688349] [2023-03-31 00:19:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-31 00:19:19,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:19,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142688349] [2023-03-31 00:19:19,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142688349] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:19,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:19:19,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:19:19,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073095639] [2023-03-31 00:19:19,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:19,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:19:19,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:19,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:19:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:19:19,115 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:19,184 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2023-03-31 00:19:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 00:19:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-03-31 00:19:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:19,186 INFO L225 Difference]: With dead ends: 64 [2023-03-31 00:19:19,186 INFO L226 Difference]: Without dead ends: 44 [2023-03-31 00:19:19,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:19:19,187 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:19,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:19:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-03-31 00:19:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-03-31 00:19:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-03-31 00:19:19,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2023-03-31 00:19:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:19,195 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-03-31 00:19:19,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-03-31 00:19:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-03-31 00:19:19,196 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:19,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:19,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 00:19:19,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:19,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1311374594, now seen corresponding path program 1 times [2023-03-31 00:19:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:19,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909783837] [2023-03-31 00:19:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-31 00:19:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909783837] [2023-03-31 00:19:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909783837] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:19:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:19:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195637719] [2023-03-31 00:19:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:19,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:19:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:19,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:19:19,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:19:19,240 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:19,302 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-03-31 00:19:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 00:19:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-03-31 00:19:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:19,304 INFO L225 Difference]: With dead ends: 58 [2023-03-31 00:19:19,304 INFO L226 Difference]: Without dead ends: 38 [2023-03-31 00:19:19,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:19:19,305 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:19,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 38 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:19:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-03-31 00:19:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-03-31 00:19:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-03-31 00:19:19,310 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2023-03-31 00:19:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:19,311 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-03-31 00:19:19,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-03-31 00:19:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 00:19:19,312 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:19,312 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] [2023-03-31 00:19:19,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 00:19:19,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:19,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1741724808, now seen corresponding path program 1 times [2023-03-31 00:19:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997327990] [2023-03-31 00:19:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:19:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:19,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997327990] [2023-03-31 00:19:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997327990] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:19:19,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516203051] [2023-03-31 00:19:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:19,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:19:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:19:19,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:19:19,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-31 00:19:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:19,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 00:19:19,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:19:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:19:19,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:19:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:19:19,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516203051] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:19:19,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:19:19,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-03-31 00:19:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185256150] [2023-03-31 00:19:19,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:19:19,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 00:19:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 00:19:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-03-31 00:19:19,578 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:19,696 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2023-03-31 00:19:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 00:19:19,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-03-31 00:19:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:19,699 INFO L225 Difference]: With dead ends: 61 [2023-03-31 00:19:19,700 INFO L226 Difference]: Without dead ends: 38 [2023-03-31 00:19:19,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-03-31 00:19:19,701 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:19,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:19:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-03-31 00:19:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-03-31 00:19:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-03-31 00:19:19,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2023-03-31 00:19:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:19,715 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-03-31 00:19:19,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-03-31 00:19:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-03-31 00:19:19,716 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:19,717 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:19,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-31 00:19:19,925 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,SelfDestructingSolverStorable5 [2023-03-31 00:19:19,926 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:19,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1222888498, now seen corresponding path program 2 times [2023-03-31 00:19:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259960428] [2023-03-31 00:19:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:19:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259960428] [2023-03-31 00:19:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259960428] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:19:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560443035] [2023-03-31 00:19:20,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-31 00:19:20,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:19:20,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:19:20,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:19:20,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-31 00:19:20,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-03-31 00:19:20,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:19:20,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2023-03-31 00:19:20,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:19:22,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:19:22,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:19:22,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:19:22,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:19:22,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:19:22,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:19:22,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 986 treesize of output 568 [2023-03-31 00:19:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-31 00:19:22,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:19:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560443035] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 00:19:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2023-03-31 00:19:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647488998] [2023-03-31 00:19:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-03-31 00:19:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:22,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-03-31 00:19:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-03-31 00:19:22,998 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:23,337 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2023-03-31 00:19:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-31 00:19:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-03-31 00:19:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:23,339 INFO L225 Difference]: With dead ends: 53 [2023-03-31 00:19:23,339 INFO L226 Difference]: Without dead ends: 34 [2023-03-31 00:19:23,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2023-03-31 00:19:23,340 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:23,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 61 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:19:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-03-31 00:19:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-03-31 00:19:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-03-31 00:19:23,346 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2023-03-31 00:19:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:23,347 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-03-31 00:19:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-03-31 00:19:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-31 00:19:23,348 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:19:23,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:23,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-31 00:19:23,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:19:23,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:19:23,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:19:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash 93340266, now seen corresponding path program 1 times [2023-03-31 00:19:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:19:23,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728463843] [2023-03-31 00:19:23,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:19:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:19:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:23,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:19:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:19:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-31 00:19:23,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:19:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728463843] [2023-03-31 00:19:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728463843] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:19:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:19:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-03-31 00:19:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484370870] [2023-03-31 00:19:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:19:23,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 00:19:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:19:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 00:19:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-03-31 00:19:23,657 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:19:23,759 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-03-31 00:19:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 00:19:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-03-31 00:19:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:19:23,761 INFO L225 Difference]: With dead ends: 38 [2023-03-31 00:19:23,761 INFO L226 Difference]: Without dead ends: 0 [2023-03-31 00:19:23,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-03-31 00:19:23,763 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:19:23,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 54 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:19:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-03-31 00:19:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-03-31 00:19:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-31 00:19:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-03-31 00:19:23,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2023-03-31 00:19:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:19:23,764 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-03-31 00:19:23,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:19:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-03-31 00:19:23,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-03-31 00:19:23,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-03-31 00:19:23,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-03-31 00:19:23,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-03-31 00:19:23,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 00:19:23,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 6 8) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-03-31 00:19:24,042 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 97) no Hoare annotation was computed. [2023-03-31 00:19:24,043 INFO L895 garLoopResultBuilder]: At program point L89(lines 64 97) the Hoare annotation is: false [2023-03-31 00:19:24,043 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 14 172) no Hoare annotation was computed. [2023-03-31 00:19:24,043 INFO L895 garLoopResultBuilder]: At program point L52(lines 50 143) the Hoare annotation is: (let ((.cse6 (mod main_~main__index2~0 4294967296))) (let ((.cse0 (< (mod main_~main__index1~0 4294967296) .cse6)) (.cse4 (= main_~__VERIFIER_assert__cond~0 1)) (.cse5 (= |main_~#main__array~0.offset| 0))) (or (let ((.cse3 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse1 (mod (+ main_~main__index2~0 1) 4294967296))) (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~main____CPAchecker_TMP_0~1 0)) .cse0 (< .cse1 100000) (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (= (mod (select .cse2 (* .cse1 4)) 4294967296) (mod (select .cse2 (* .cse3 4)) 4294967296))) (< .cse3 .cse1) .cse4 .cse5)) (and (< .cse6 100000) (= main_~main____CPAchecker_TMP_0~0 1) .cse0 .cse4 .cse5)))) [2023-03-31 00:19:24,043 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2023-03-31 00:19:24,043 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-03-31 00:19:24,043 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 143) no Hoare annotation was computed. [2023-03-31 00:19:24,043 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 105 131) the Hoare annotation is: (let ((.cse3 (= |main_~#main__array~0.offset| 0))) (or (let ((.cse2 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse0 (mod (+ main_~main__index2~0 1) 4294967296))) (and (< .cse0 100000) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|))) (= (mod (select .cse1 (* .cse0 4)) 4294967296) (mod (select .cse1 (* .cse2 4)) 4294967296))) (< .cse2 .cse0) .cse3)) (let ((.cse4 (mod main_~main__index2~0 4294967296))) (and (< .cse4 100000) (< (mod main_~main__index1~0 4294967296) .cse4) (= main_~__VERIFIER_assert__cond~2 1) .cse3)))) [2023-03-31 00:19:24,044 INFO L895 garLoopResultBuilder]: At program point $Ultimate##30(lines 102 136) the Hoare annotation is: (or (let ((.cse2 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse0 (mod (+ main_~main__index2~0 1) 4294967296))) (and (< .cse0 100000) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|))) (= (mod (select .cse1 (* .cse0 4)) 4294967296) (mod (select .cse1 (* .cse2 4)) 4294967296))) (< .cse2 .cse0) (= |main_~#main__array~0.offset| 0))) (= main_~main__loop_entered~0 0)) [2023-03-31 00:19:24,044 INFO L895 garLoopResultBuilder]: At program point L69(lines 66 92) the Hoare annotation is: (let ((.cse2 (mod (+ 4294967295 main_~main__index1~0) 4294967296)) (.cse0 (mod (+ main_~main__index2~0 1) 4294967296))) (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (< .cse0 100000) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|))) (= (mod (select .cse1 (* .cse0 4)) 4294967296) (mod (select .cse1 (* .cse2 4)) 4294967296))) (< .cse2 .cse0) (= main_~__VERIFIER_assert__cond~0 1) (= |main_~#main__array~0.offset| 0))) [2023-03-31 00:19:24,044 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2023-03-31 00:19:24,044 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 137) no Hoare annotation was computed. [2023-03-31 00:19:24,044 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 166) no Hoare annotation was computed. [2023-03-31 00:19:24,044 INFO L895 garLoopResultBuilder]: At program point L148(lines 33 156) the Hoare annotation is: false [2023-03-31 00:19:24,044 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2023-03-31 00:19:24,044 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= main_~main__loop_entered~0 0) (= |main_~#main__array~0.offset| 0)) [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 92) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 156) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 171) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 142) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 124) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 14 172) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 84) no Hoare annotation was computed. [2023-03-31 00:19:24,045 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 172) the Hoare annotation is: (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) [2023-03-31 00:19:24,045 INFO L895 garLoopResultBuilder]: At program point L38(lines 35 151) the Hoare annotation is: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= main_~main____CPAchecker_TMP_0~0 1) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= main_~main__loop_entered~0 0) (<= main_~main__index2~0 (+ (* (div main_~main__index2~0 4294967296) 4294967296) 99999)) (= |main_~#main__array~0.offset| 0)) [2023-03-31 00:19:24,045 INFO L902 garLoopResultBuilder]: At program point L129(lines 102 136) the Hoare annotation is: true [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 161) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 151) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_136~0)| ~__return_136~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-03-31 00:19:24,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-03-31 00:19:24,046 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-03-31 00:19:24,049 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-03-31 00:19:24,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 00:19:24,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 12:19:24 BoogieIcfgContainer [2023-03-31 00:19:24,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 00:19:24,081 INFO L158 Benchmark]: Toolchain (without parser) took 7200.64ms. Allocated memory was 314.6MB in the beginning and 390.1MB in the end (delta: 75.5MB). Free memory was 269.5MB in the beginning and 223.8MB in the end (delta: 45.7MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2023-03-31 00:19:24,081 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 00:19:24,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.09ms. Allocated memory is still 314.6MB. Free memory was 269.0MB in the beginning and 257.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-03-31 00:19:24,082 INFO L158 Benchmark]: Boogie Preprocessor took 25.77ms. Allocated memory is still 314.6MB. Free memory was 257.4MB in the beginning and 255.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-31 00:19:24,082 INFO L158 Benchmark]: RCFGBuilder took 406.38ms. Allocated memory is still 314.6MB. Free memory was 255.4MB in the beginning and 241.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-03-31 00:19:24,082 INFO L158 Benchmark]: TraceAbstraction took 6555.54ms. Allocated memory was 314.6MB in the beginning and 390.1MB in the end (delta: 75.5MB). Free memory was 240.7MB in the beginning and 223.8MB in the end (delta: 16.8MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. [2023-03-31 00:19:24,084 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.09ms. Allocated memory is still 314.6MB. Free memory was 269.0MB in the beginning and 257.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.77ms. Allocated memory is still 314.6MB. Free memory was 257.4MB in the beginning and 255.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.38ms. Allocated memory is still 314.6MB. Free memory was 255.4MB in the beginning and 241.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6555.54ms. Allocated memory was 314.6MB in the beginning and 390.1MB in the end (delta: 75.5MB). Free memory was 240.7MB in the beginning and 223.8MB in the end (delta: 16.8MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 77]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 182 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 28 NumberOfFragments, 338 HoareAnnotationTreeSize, 13 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 225 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 243 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 862 SizeOfPredicates, 9 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 36/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((main__index2 + 1) % 4294967296 < 100000 && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && main__array == 0) || main__loop_entered == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((__tmp_155_0 == \old(__tmp_155_0) && main____CPAchecker_TMP_0 == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && main__loop_entered == 0) && main__index2 <= main__index2 / 4294967296 * 4294967296 + 99999) && main__array == 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (__tmp_155_0 == \old(__tmp_155_0) && main__loop_entered == 0) && main__array == 0 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((((!(main____CPAchecker_TMP_0 == 0) && main__index1 % 4294967296 < main__index2 % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((main__index2 + 1) % 4294967296 < 100000 && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && main__array == 0) || (((main__index2 % 4294967296 < 100000 && main__index1 % 4294967296 < main__index2 % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((!(__VERIFIER_assert__cond == 0) && !(main____CPAchecker_TMP_0 == 0)) && main__index1 % 4294967296 < main__index2 % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][(4294967295 + main__index1) % 4294967296 * 4] % 4294967296) && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0) || ((((main__index2 % 4294967296 < 100000 && main____CPAchecker_TMP_0 == 1) && main__index1 % 4294967296 < main__index2 % 4294967296) && __VERIFIER_assert__cond == 1) && main__array == 0) RESULT: Ultimate proved your program to be correct! [2023-03-31 00:19:24,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...