/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 22:43:32,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 22:43:32,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 22:43:32,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 22:43:32,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 22:43:32,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 22:43:32,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 22:43:32,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 22:43:32,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 22:43:32,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 22:43:32,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 22:43:32,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 22:43:32,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 22:43:32,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 22:43:32,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 22:43:32,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 22:43:32,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 22:43:32,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 22:43:32,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 22:43:32,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 22:43:32,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 22:43:32,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 22:43:32,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 22:43:32,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 22:43:32,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 22:43:32,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 22:43:32,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 22:43:32,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 22:43:32,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 22:43:32,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 22:43:32,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 22:43:32,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 22:43:32,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 22:43:32,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 22:43:32,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 22:43:32,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 22:43:32,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 22:43:32,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 22:43:32,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 22:43:32,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 22:43:32,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 22:43:32,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-03-31 22:43:32,266 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 22:43:32,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 22:43:32,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 22:43:32,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 22:43:32,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 22:43:32,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 22:43:32,268 INFO L138 SettingsManager]: * User list type=DISABLED [2023-03-31 22:43:32,268 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-03-31 22:43:32,269 INFO L138 SettingsManager]: * Explicit value domain=true [2023-03-31 22:43:32,269 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-03-31 22:43:32,269 INFO L138 SettingsManager]: * Octagon Domain=false [2023-03-31 22:43:32,270 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-03-31 22:43:32,270 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-03-31 22:43:32,270 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-03-31 22:43:32,270 INFO L138 SettingsManager]: * Interval Domain=false [2023-03-31 22:43:32,270 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-03-31 22:43:32,270 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-03-31 22:43:32,270 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-03-31 22:43:32,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 22:43:32,271 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 22:43:32,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 22:43:32,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 22:43:32,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 22:43:32,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 22:43:32,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 22:43:32,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:43:32,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 22:43:32,273 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-03-31 22:43:32,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 22:43:32,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 22:43:32,274 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-03-31 22:43:32,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 22:43:32,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 22:43:32,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-03-31 22:43:32,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-03-31 22:43:32,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 22:43:32,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 22:43:32,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 22:43:32,531 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 22:43:32,531 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 22:43:32,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-03-31 22:43:33,770 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 22:43:33,954 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 22:43:33,954 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-03-31 22:43:33,959 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbc40248/6f9a0eef2a54466f9f1f8d71aa6e618f/FLAG330281932 [2023-03-31 22:43:33,972 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbc40248/6f9a0eef2a54466f9f1f8d71aa6e618f [2023-03-31 22:43:33,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 22:43:33,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 22:43:33,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 22:43:33,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 22:43:33,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 22:43:33,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:43:33" (1/1) ... [2023-03-31 22:43:33,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483db147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:33, skipping insertion in model container [2023-03-31 22:43:33,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:43:33" (1/1) ... [2023-03-31 22:43:33,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 22:43:34,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 22:43:34,126 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-03-31 22:43:34,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:43:34,147 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 22:43:34,164 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/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-03-31 22:43:34,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:43:34,178 INFO L208 MainTranslator]: Completed translation [2023-03-31 22:43:34,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34 WrapperNode [2023-03-31 22:43:34,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 22:43:34,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 22:43:34,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 22:43:34,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 22:43:34,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 22:43:34,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 22:43:34,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 22:43:34,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 22:43:34,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (1/1) ... [2023-03-31 22:43:34,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:43:34,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:34,258 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 22:43:34,281 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 22:43:34,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 22:43:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 22:43:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 22:43:34,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 22:43:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 22:43:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 22:43:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 22:43:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 22:43:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-31 22:43:34,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 22:43:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 22:43:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 22:43:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 22:43:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 22:43:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 22:43:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 22:43:34,352 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 22:43:34,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 22:43:34,508 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 22:43:34,521 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 22:43:34,522 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-03-31 22:43:34,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:43:34 BoogieIcfgContainer [2023-03-31 22:43:34,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 22:43:34,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 22:43:34,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 22:43:34,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 22:43:34,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 10:43:33" (1/3) ... [2023-03-31 22:43:34,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72568712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:43:34, skipping insertion in model container [2023-03-31 22:43:34,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:43:34" (2/3) ... [2023-03-31 22:43:34,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72568712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:43:34, skipping insertion in model container [2023-03-31 22:43:34,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:43:34" (3/3) ... [2023-03-31 22:43:34,541 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-03-31 22:43:34,574 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 22:43:34,575 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 22:43:34,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 22:43:34,620 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=FINITE_AUTOMATA, 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;@435fe920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-31 22:43:34,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 22:43:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 22:43:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-03-31 22:43:34,632 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:34,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:34,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:34,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -184555834, now seen corresponding path program 1 times [2023-03-31 22:43:34,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519337710] [2023-03-31 22:43:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:34,833 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 22:43:34,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519337710] [2023-03-31 22:43:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519337710] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:43:34,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:43:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-31 22:43:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506179425] [2023-03-31 22:43:34,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:43:34,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 22:43:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 22:43:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 22:43:34,890 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 22:43:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:34,919 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-03-31 22:43:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 22:43:34,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2023-03-31 22:43:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:34,927 INFO L225 Difference]: With dead ends: 29 [2023-03-31 22:43:34,928 INFO L226 Difference]: Without dead ends: 14 [2023-03-31 22:43:34,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 22:43:34,934 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:34,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:43:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-03-31 22:43:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-03-31 22:43:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 22:43:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-03-31 22:43:34,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2023-03-31 22:43:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:34,978 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-03-31 22:43:34,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 22:43:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-03-31 22:43:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-03-31 22:43:34,980 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:34,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 22:43:34,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:34,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:34,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1004975889, now seen corresponding path program 1 times [2023-03-31 22:43:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363069544] [2023-03-31 22:43:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:35,068 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 22:43:35,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:35,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363069544] [2023-03-31 22:43:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363069544] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:35,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539142778] [2023-03-31 22:43:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:35,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:35,079 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 22:43:35,081 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 22:43:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:35,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 22:43:35,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:35,208 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 22:43:35,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:35,236 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 22:43:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539142778] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [288899095] [2023-03-31 22:43:35,255 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:35,256 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:35,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:35,264 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:35,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:35,371 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:35,444 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:35,460 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [288899095] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:43:35,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 14 [2023-03-31 22:43:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80378547] [2023-03-31 22:43:35,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:43:35,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-31 22:43:35,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:35,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-31 22:43:35,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-03-31 22:43:35,659 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 22:43:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:36,113 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-03-31 22:43:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 22:43:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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) Word has length 12 [2023-03-31 22:43:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:36,114 INFO L225 Difference]: With dead ends: 18 [2023-03-31 22:43:36,114 INFO L226 Difference]: Without dead ends: 14 [2023-03-31 22:43:36,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-03-31 22:43:36,116 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:43:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-03-31 22:43:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-03-31 22:43:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 22:43:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-03-31 22:43:36,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2023-03-31 22:43:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:36,123 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-03-31 22:43:36,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 22:43:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-03-31 22:43:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-03-31 22:43:36,124 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:36,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:36,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-03-31 22:43:36,345 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 22:43:36,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:36,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1020079926, now seen corresponding path program 1 times [2023-03-31 22:43:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027859565] [2023-03-31 22:43:36,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:36,412 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 22:43:36,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027859565] [2023-03-31 22:43:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027859565] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962692243] [2023-03-31 22:43:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:36,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:36,417 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 22:43:36,421 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 22:43:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:36,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-03-31 22:43:36,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:36,515 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 22:43:36,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:36,533 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 22:43:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962692243] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:36,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777457488] [2023-03-31 22:43:36,535 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:36,536 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:36,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:36,536 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:36,536 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:36,586 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:36,648 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:36,655 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:36,788 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '302#(and (= main_~__VERIFIER_assert__cond~0 0) (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__tmp_1~0 0) (= |#NULL.offset| 0) (<= 100 main_~main__i~0) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2023-03-31 22:43:36,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:43:36,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-03-31 22:43:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238401370] [2023-03-31 22:43:36,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:43:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 22:43:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 22:43:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-03-31 22:43:36,794 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 22:43:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:36,821 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-03-31 22:43:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 22:43:36,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 12 [2023-03-31 22:43:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:36,822 INFO L225 Difference]: With dead ends: 24 [2023-03-31 22:43:36,822 INFO L226 Difference]: Without dead ends: 17 [2023-03-31 22:43:36,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-03-31 22:43:36,825 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:36,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:43:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-03-31 22:43:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-03-31 22:43:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 22:43:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-03-31 22:43:36,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2023-03-31 22:43:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:36,847 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-03-31 22:43:36,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 22:43:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-03-31 22:43:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-03-31 22:43:36,848 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:36,848 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:36,857 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 22:43:37,054 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,SelfDestructingSolverStorable2 [2023-03-31 22:43:37,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:37,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash -516056661, now seen corresponding path program 2 times [2023-03-31 22:43:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312653537] [2023-03-31 22:43:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:37,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312653537] [2023-03-31 22:43:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312653537] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:37,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122723383] [2023-03-31 22:43:37,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 22:43:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:37,186 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 22:43:37,189 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 22:43:37,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-31 22:43:37,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:43:37,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-31 22:43:37,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:37,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122723383] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430759468] [2023-03-31 22:43:37,300 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:37,300 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:37,300 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:37,300 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:37,301 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:37,328 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:37,362 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:37,369 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:37,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '474#(and (= main_~__VERIFIER_assert__cond~0 0) (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__tmp_1~0 0) (= |#NULL.offset| 0) (<= 100 main_~main__i~0) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2023-03-31 22:43:37,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:43:37,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:37,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-03-31 22:43:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916088896] [2023-03-31 22:43:37,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:43:37,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-31 22:43:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-31 22:43:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-03-31 22:43:37,498 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 22:43:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:37,526 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2023-03-31 22:43:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 22:43:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 15 [2023-03-31 22:43:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:37,528 INFO L225 Difference]: With dead ends: 30 [2023-03-31 22:43:37,529 INFO L226 Difference]: Without dead ends: 23 [2023-03-31 22:43:37,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-03-31 22:43:37,531 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:37,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:43:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-03-31 22:43:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-03-31 22:43:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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 22:43:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-03-31 22:43:37,547 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2023-03-31 22:43:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:37,547 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-03-31 22:43:37,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 22:43:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-03-31 22:43:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-31 22:43:37,549 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:37,549 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:37,563 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 22:43:37,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:37,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:37,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash -379314741, now seen corresponding path program 3 times [2023-03-31 22:43:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264609718] [2023-03-31 22:43:37,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:37,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264609718] [2023-03-31 22:43:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264609718] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335212757] [2023-03-31 22:43:37,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 22:43:37,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:37,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:37,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:43:38,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-31 22:43:38,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 22:43:38,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:43:38,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2023-03-31 22:43:38,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:38,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335212757] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1536580915] [2023-03-31 22:43:38,284 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:38,284 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:38,284 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:38,289 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:38,289 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:38,313 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:38,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:38,350 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:38,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '718#(and (= main_~__VERIFIER_assert__cond~0 0) (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__tmp_1~0 0) (= |#NULL.offset| 0) (<= 100 main_~main__i~0) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2023-03-31 22:43:38,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:43:38,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-03-31 22:43:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494459081] [2023-03-31 22:43:38,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:43:38,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-03-31 22:43:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-03-31 22:43:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=667, Unknown=0, NotChecked=0, Total=992 [2023-03-31 22:43:38,498 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 22:43:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:38,547 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2023-03-31 22:43:38,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-03-31 22:43:38,548 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 21 [2023-03-31 22:43:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:38,550 INFO L225 Difference]: With dead ends: 42 [2023-03-31 22:43:38,550 INFO L226 Difference]: Without dead ends: 35 [2023-03-31 22:43:38,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=667, Unknown=0, NotChecked=0, Total=992 [2023-03-31 22:43:38,551 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:38,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:43:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-03-31 22:43:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-03-31 22:43:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 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 22:43:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-03-31 22:43:38,573 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 21 [2023-03-31 22:43:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:38,573 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-03-31 22:43:38,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 22:43:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-03-31 22:43:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-03-31 22:43:38,576 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:38,576 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:38,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-31 22:43:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:38,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:38,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1866489355, now seen corresponding path program 4 times [2023-03-31 22:43:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41861712] [2023-03-31 22:43:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:39,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41861712] [2023-03-31 22:43:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41861712] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694653358] [2023-03-31 22:43:39,258 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-03-31 22:43:39,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:39,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:39,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:43:39,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-31 22:43:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:39,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjunts are in the unsatisfiable core [2023-03-31 22:43:39,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:39,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694653358] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [950575620] [2023-03-31 22:43:40,067 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:40,067 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:40,068 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:40,068 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:40,068 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:40,092 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:40,114 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:40,118 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:40,296 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1106#(and (= main_~__VERIFIER_assert__cond~0 0) (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__tmp_1~0 0) (= |#NULL.offset| 0) (<= 100 main_~main__i~0) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2023-03-31 22:43:40,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:43:40,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-03-31 22:43:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535222344] [2023-03-31 22:43:40,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:43:40,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-03-31 22:43:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-03-31 22:43:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=1879, Unknown=0, NotChecked=0, Total=3080 [2023-03-31 22:43:40,300 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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 22:43:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:40,396 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2023-03-31 22:43:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-03-31 22:43:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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 33 [2023-03-31 22:43:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:40,398 INFO L225 Difference]: With dead ends: 66 [2023-03-31 22:43:40,398 INFO L226 Difference]: Without dead ends: 59 [2023-03-31 22:43:40,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1201, Invalid=1879, Unknown=0, NotChecked=0, Total=3080 [2023-03-31 22:43:40,401 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:40,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:43:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-03-31 22:43:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-03-31 22:43:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 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 22:43:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2023-03-31 22:43:40,446 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 33 [2023-03-31 22:43:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:40,446 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2023-03-31 22:43:40,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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 22:43:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2023-03-31 22:43:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-03-31 22:43:40,450 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:40,451 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:40,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-31 22:43:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:40,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:40,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1051573899, now seen corresponding path program 5 times [2023-03-31 22:43:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:40,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675087187] [2023-03-31 22:43:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:41,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675087187] [2023-03-31 22:43:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675087187] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966286449] [2023-03-31 22:43:41,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 22:43:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:41,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:43:41,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-31 22:43:42,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2023-03-31 22:43:42,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:43:42,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 48 conjunts are in the unsatisfiable core [2023-03-31 22:43:42,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:42,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:44,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966286449] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:44,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1941252679] [2023-03-31 22:43:44,437 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:44,437 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:44,438 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:44,438 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:44,438 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:44,468 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:44,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:44,509 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:44,744 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1782#(and (= main_~__VERIFIER_assert__cond~0 0) (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__tmp_1~0 0) (= |#NULL.offset| 0) (<= 100 main_~main__i~0) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2023-03-31 22:43:44,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:43:44,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-03-31 22:43:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564619904] [2023-03-31 22:43:44,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:43:44,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-03-31 22:43:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-03-31 22:43:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4681, Invalid=6031, Unknown=0, NotChecked=0, Total=10712 [2023-03-31 22:43:44,751 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 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 22:43:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:44,919 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2023-03-31 22:43:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-03-31 22:43:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 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 57 [2023-03-31 22:43:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:44,924 INFO L225 Difference]: With dead ends: 114 [2023-03-31 22:43:44,924 INFO L226 Difference]: Without dead ends: 107 [2023-03-31 22:43:44,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4681, Invalid=6031, Unknown=0, NotChecked=0, Total=10712 [2023-03-31 22:43:44,928 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:44,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:43:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-03-31 22:43:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-03-31 22:43:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 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 22:43:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2023-03-31 22:43:44,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 57 [2023-03-31 22:43:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:44,979 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2023-03-31 22:43:44,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 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 22:43:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2023-03-31 22:43:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-03-31 22:43:44,985 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:44,985 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:45,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-03-31 22:43:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:45,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:45,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -870580341, now seen corresponding path program 6 times [2023-03-31 22:43:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:45,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995890893] [2023-03-31 22:43:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:43:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:49,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:43:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995890893] [2023-03-31 22:43:49,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995890893] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:43:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285306698] [2023-03-31 22:43:49,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 22:43:49,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:49,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:43:49,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:43:49,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-31 22:43:49,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 22:43:49,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:43:49,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 96 conjunts are in the unsatisfiable core [2023-03-31 22:43:49,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:43:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:49,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:43:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:43:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285306698] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:43:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1091658900] [2023-03-31 22:43:53,004 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-03-31 22:43:53,004 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:43:53,005 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:43:53,005 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:43:53,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:43:53,033 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2023-03-31 22:43:53,063 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-03-31 22:43:53,071 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:43:53,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2944#(and (= main_~__VERIFIER_assert__cond~0 0) (= main_~main____CPAchecker_TMP_0~0 0) (= main_~__tmp_1~0 0) (= |#NULL.offset| 0) (<= 100 main_~main__i~0) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2023-03-31 22:43:53,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:43:53,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:43:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2023-03-31 22:43:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003942322] [2023-03-31 22:43:53,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:43:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-03-31 22:43:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:43:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-03-31 22:43:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5278, Invalid=6712, Unknown=0, NotChecked=0, Total=11990 [2023-03-31 22:43:53,417 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 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 22:43:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:43:53,580 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2023-03-31 22:43:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-03-31 22:43:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 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 105 [2023-03-31 22:43:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:43:53,582 INFO L225 Difference]: With dead ends: 120 [2023-03-31 22:43:53,582 INFO L226 Difference]: Without dead ends: 113 [2023-03-31 22:43:53,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 213 SyntacticMatches, 90 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5569 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5278, Invalid=6712, Unknown=0, NotChecked=0, Total=11990 [2023-03-31 22:43:53,586 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:43:53,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:43:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-03-31 22:43:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-03-31 22:43:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 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 22:43:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2023-03-31 22:43:53,622 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 105 [2023-03-31 22:43:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:43:53,622 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2023-03-31 22:43:53,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 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 22:43:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2023-03-31 22:43:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-03-31 22:43:53,625 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:43:53,625 INFO L195 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:43:53,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-31 22:43:53,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:43:53,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:43:53,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:43:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -728327253, now seen corresponding path program 7 times [2023-03-31 22:43:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:43:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848261894] [2023-03-31 22:43:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:43:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:43:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 22:43:53,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-31 22:43:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 22:43:53,998 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-03-31 22:43:54,000 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-31 22:43:54,001 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-31 22:43:54,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 22:43:54,005 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2023-03-31 22:43:54,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 22:43:54,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 10:43:54 BoogieIcfgContainer [2023-03-31 22:43:54,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 22:43:54,124 INFO L158 Benchmark]: Toolchain (without parser) took 20148.19ms. Allocated memory was 261.1MB in the beginning and 399.5MB in the end (delta: 138.4MB). Free memory was 214.5MB in the beginning and 265.0MB in the end (delta: -50.5MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. [2023-03-31 22:43:54,124 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 22:43:54,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.28ms. Allocated memory is still 261.1MB. Free memory was 214.5MB in the beginning and 204.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-03-31 22:43:54,124 INFO L158 Benchmark]: Boogie Preprocessor took 40.04ms. Allocated memory is still 261.1MB. Free memory was 204.0MB in the beginning and 202.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-03-31 22:43:54,125 INFO L158 Benchmark]: RCFGBuilder took 313.99ms. Allocated memory is still 261.1MB. Free memory was 202.5MB in the beginning and 192.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-03-31 22:43:54,125 INFO L158 Benchmark]: TraceAbstraction took 19586.84ms. Allocated memory was 261.1MB in the beginning and 399.5MB in the end (delta: 138.4MB). Free memory was 191.4MB in the beginning and 265.0MB in the end (delta: -73.6MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2023-03-31 22:43:54,127 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.11ms. Allocated memory is still 184.5MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.28ms. Allocated memory is still 261.1MB. Free memory was 214.5MB in the beginning and 204.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.04ms. Allocated memory is still 261.1MB. Free memory was 204.0MB in the beginning and 202.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.99ms. Allocated memory is still 261.1MB. Free memory was 202.5MB in the beginning and 192.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19586.84ms. Allocated memory was 261.1MB in the beginning and 399.5MB in the end (delta: 138.4MB). Free memory was 191.4MB in the beginning and 265.0MB in the end (delta: -73.6MB). Peak memory consumption was 65.8MB. 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 - UnprovableResult [Line: 41]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 19. Possible FailurePath: [L1] int __return_main; [L9] double main__x0; [L10] double main__x1; [L11] double main__x2; [L12] int main__i; [L13] main__x0 = 5.5 [L14] main__x1 = 5.545454545454546 [L15] main__i = 0 VAL [__return_main=0, main__i=0, main__x0=11/2, main__x1=2772727272727273/500000000000000] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__x0=2772727272727273/500000000000000, main__x1=108, main__x2=108] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__x0=108, main__x1=137, main__x2=137] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__x0=137, main__x1=112, main__x2=112] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__x0=112, main__x1=111, main__x2=111] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__x0=111, main__x1=195, main__x2=195] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__x0=195, main__x1=192, main__x2=192] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__x0=192, main__x1=140, main__x2=140] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__x0=140, main__x1=181, main__x2=181] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__x0=181, main__x1=204, main__x2=204] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__x0=204, main__x1=170, main__x2=170] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=11, main__x0=170, main__x1=200, main__x2=200] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=12, main__x0=200, main__x1=144, main__x2=144] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=13, main__x0=144, main__x1=206, main__x2=206] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=14, main__x0=206, main__x1=172, main__x2=172] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=15, main__x0=172, main__x1=138, main__x2=138] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=16, main__x0=138, main__x1=123, main__x2=123] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=17, main__x0=123, main__x1=198, main__x2=198] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=18, main__x0=198, main__x1=130, main__x2=130] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=19, main__x0=130, main__x1=116, main__x2=116] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=20, main__x0=116, main__x1=197, main__x2=197] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=21, main__x0=197, main__x1=147, main__x2=147] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=22, main__x0=147, main__x1=189, main__x2=189] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=23, main__x0=189, main__x1=187, main__x2=187] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=24, main__x0=187, main__x1=141, main__x2=141] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=25, main__x0=141, main__x1=179, main__x2=179] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=26, main__x0=179, main__x1=113, main__x2=113] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=27, main__x0=113, main__x1=122, main__x2=122] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=28, main__x0=122, main__x1=155, main__x2=155] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=29, main__x0=155, main__x1=199, main__x2=199] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=30, main__x0=199, main__x1=178, main__x2=178] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=31, main__x0=178, main__x1=205, main__x2=205] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=32, main__x0=205, main__x1=124, main__x2=124] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=33, main__x0=124, main__x1=203, main__x2=203] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=34, main__x0=203, main__x1=165, main__x2=165] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=35, main__x0=165, main__x1=109, main__x2=109] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=36, main__x0=109, main__x1=142, main__x2=142] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=37, main__x0=142, main__x1=134, main__x2=134] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=38, main__x0=134, main__x1=118, main__x2=118] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=39, main__x0=118, main__x1=201, main__x2=201] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=40, main__x0=201, main__x1=154, main__x2=154] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=41, main__x0=154, main__x1=163, main__x2=163] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=42, main__x0=163, main__x1=120, main__x2=120] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=43, main__x0=120, main__x1=143, main__x2=143] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=44, main__x0=143, main__x1=151, main__x2=151] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=45, main__x0=151, main__x1=202, main__x2=202] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=46, main__x0=202, main__x1=168, main__x2=168] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=47, main__x0=168, main__x1=131, main__x2=131] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=48, main__x0=131, main__x1=190, main__x2=190] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=49, main__x0=190, main__x1=175, main__x2=175] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=50, main__x0=175, main__x1=135, main__x2=135] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=51, main__x0=135, main__x1=186, main__x2=186] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=52, main__x0=186, main__x1=152, main__x2=152] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=53, main__x0=152, main__x1=188, main__x2=188] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=54, main__x0=188, main__x1=177, main__x2=177] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=55, main__x0=177, main__x1=191, main__x2=191] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=56, main__x0=191, main__x1=196, main__x2=196] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=57, main__x0=196, main__x1=161, main__x2=161] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=58, main__x0=161, main__x1=110, main__x2=110] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=59, main__x0=110, main__x1=149, main__x2=149] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=60, main__x0=149, main__x1=176, main__x2=176] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=61, main__x0=176, main__x1=157, main__x2=157] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=62, main__x0=157, main__x1=193, main__x2=193] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=63, main__x0=193, main__x1=185, main__x2=185] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=64, main__x0=185, main__x1=158, main__x2=158] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=65, main__x0=158, main__x1=133, main__x2=133] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=66, main__x0=133, main__x1=159, main__x2=159] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=67, main__x0=159, main__x1=117, main__x2=117] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=68, main__x0=117, main__x1=194, main__x2=194] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=69, main__x0=194, main__x1=180, main__x2=180] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=70, main__x0=180, main__x1=160, main__x2=160] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=71, main__x0=160, main__x1=207, main__x2=207] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=72, main__x0=207, main__x1=169, main__x2=169] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=73, main__x0=169, main__x1=129, main__x2=129] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=74, main__x0=129, main__x1=156, main__x2=156] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=75, main__x0=156, main__x1=132, main__x2=132] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=76, main__x0=132, main__x1=182, main__x2=182] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=77, main__x0=182, main__x1=183, main__x2=183] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=78, main__x0=183, main__x1=164, main__x2=164] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=79, main__x0=164, main__x1=150, main__x2=150] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=80, main__x0=150, main__x1=162, main__x2=162] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=81, main__x0=162, main__x1=126, main__x2=126] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=82, main__x0=126, main__x1=148, main__x2=148] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=83, main__x0=148, main__x1=128, main__x2=128] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=84, main__x0=128, main__x1=115, main__x2=115] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=85, main__x0=115, main__x1=114, main__x2=114] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=86, main__x0=114, main__x1=145, main__x2=145] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=87, main__x0=145, main__x1=184, main__x2=184] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=88, main__x0=184, main__x1=166, main__x2=166] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=89, main__x0=166, main__x1=119, main__x2=119] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=90, main__x0=119, main__x1=121, main__x2=121] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=91, main__x0=121, main__x1=153, main__x2=153] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=92, main__x0=153, main__x1=146, main__x2=146] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=93, main__x0=146, main__x1=174, main__x2=174] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=94, main__x0=174, main__x1=139, main__x2=139] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=95, main__x0=139, main__x1=125, main__x2=125] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=96, main__x0=125, main__x1=173, main__x2=173] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=97, main__x0=173, main__x1=171, main__x2=171] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=98, main__x0=171, main__x1=127, main__x2=127] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=99, main__x0=127, main__x1=136, main__x2=136] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] [L17] COND FALSE !(main__i < 100) [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] [L28] COND FALSE !(main__x0 >= 99.0) VAL [__return_main=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] [L53] main____CPAchecker_TMP_0 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] [L35] int __tmp_1; [L36] __tmp_1 = main____CPAchecker_TMP_0 [L37] int __VERIFIER_assert__cond; [L38] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] [L39] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] [L41] reach_error() VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=136, main__x1=167, main__x2=167] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 9, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 92 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 965 GetRequests, 533 SyntacticMatches, 90 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7830 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 1866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1674 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 0/17598 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: OVERALL_TIME: 0.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 11, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 11, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 4, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 17, TOOLS_QUANTIFIERELIM_TIME: 0.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 37, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 2, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 11, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 74, DAG_COMPRESSION_RETAINED_NODES: 40, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-03-31 22:43:54,155 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...