/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 OctagonDomain -i ../sv-benchmarks/c/float-benchs/Muller_Kahan.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 04:43:47,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 04:43:47,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 04:43:47,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 04:43:47,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 04:43:47,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 04:43:47,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 04:43:47,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 04:43:47,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 04:43:47,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 04:43:47,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 04:43:47,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 04:43:47,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 04:43:47,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 04:43:47,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 04:43:47,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 04:43:47,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 04:43:47,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 04:43:47,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 04:43:47,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 04:43:47,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 04:43:47,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 04:43:47,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 04:43:47,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 04:43:47,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 04:43:47,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 04:43:47,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 04:43:47,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 04:43:47,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 04:43:47,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 04:43:47,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 04:43:47,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 04:43:47,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 04:43:47,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 04:43:47,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 04:43:47,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 04:43:47,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 04:43:47,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 04:43:47,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 04:43:47,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 04:43:47,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 04:43:47,388 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-04-01 04:43:47,422 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 04:43:47,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 04:43:47,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 04:43:47,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 04:43:47,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 04:43:47,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 04:43:47,424 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 04:43:47,424 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 04:43:47,424 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 04:43:47,424 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 04:43:47,424 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 04:43:47,424 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 04:43:47,425 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 04:43:47,425 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 04:43:47,425 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 04:43:47,425 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 04:43:47,425 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 04:43:47,425 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 04:43:47,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 04:43:47,426 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 04:43:47,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 04:43:47,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 04:43:47,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 04:43:47,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 04:43:47,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 04:43:47,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 04:43:47,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:43:47,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 04:43:47,428 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 04:43:47,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 04:43:47,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 04:43:47,428 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 04:43:47,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 04:43:47,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 04:43:47,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 04:43:47,433 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 -> OctagonDomain [2023-04-01 04:43:47,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 04:43:47,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 04:43:47,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 04:43:47,727 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 04:43:47,728 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 04:43:47,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2023-04-01 04:43:48,942 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 04:43:49,112 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 04:43:49,113 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2023-04-01 04:43:49,118 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e725966/2575534632fa4839bdc718dd5b92f61b/FLAGeedc795b1 [2023-04-01 04:43:49,139 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e725966/2575534632fa4839bdc718dd5b92f61b [2023-04-01 04:43:49,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 04:43:49,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 04:43:49,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 04:43:49,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 04:43:49,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 04:43:49,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d3dd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49, skipping insertion in model container [2023-04-01 04:43:49,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 04:43:49,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 04:43:49,274 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[631,644] [2023-04-01 04:43:49,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:43:49,295 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 04:43:49,305 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[631,644] [2023-04-01 04:43:49,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:43:49,318 INFO L208 MainTranslator]: Completed translation [2023-04-01 04:43:49,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49 WrapperNode [2023-04-01 04:43:49,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 04:43:49,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 04:43:49,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 04:43:49,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 04:43:49,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 04:43:49,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 04:43:49,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 04:43:49,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 04:43:49,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (1/1) ... [2023-04-01 04:43:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:43:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:43:49,378 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-04-01 04:43:49,380 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-04-01 04:43:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 04:43:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 04:43:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 04:43:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 04:43:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 04:43:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 04:43:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 04:43:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 04:43:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 04:43:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 04:43:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 04:43:49,465 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 04:43:49,467 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 04:43:49,609 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 04:43:49,629 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 04:43:49,629 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 04:43:49,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:43:49 BoogieIcfgContainer [2023-04-01 04:43:49,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 04:43:49,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 04:43:49,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 04:43:49,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 04:43:49,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 04:43:49" (1/3) ... [2023-04-01 04:43:49,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d45202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:43:49, skipping insertion in model container [2023-04-01 04:43:49,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:43:49" (2/3) ... [2023-04-01 04:43:49,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d45202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:43:49, skipping insertion in model container [2023-04-01 04:43:49,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:43:49" (3/3) ... [2023-04-01 04:43:49,643 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2023-04-01 04:43:49,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 04:43:49,658 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 04:43:49,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 04:43:49,719 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;@3240b8cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 04:43:49,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 04:43:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 04:43:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-04-01 04:43:49,731 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:49,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:49,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:49,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash -970898460, now seen corresponding path program 1 times [2023-04-01 04:43:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298260161] [2023-04-01 04:43:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:49,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:43:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298260161] [2023-04-01 04:43:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298260161] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:43:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:43:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 04:43:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320309865] [2023-04-01 04:43:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:43:49,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 04:43:49,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:43:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 04:43:50,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 04:43:50,014 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:43:50,073 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-04-01 04:43:50,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 04:43:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-04-01 04:43:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:43:50,081 INFO L225 Difference]: With dead ends: 29 [2023-04-01 04:43:50,081 INFO L226 Difference]: Without dead ends: 12 [2023-04-01 04:43:50,083 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-04-01 04:43:50,086 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:43:50,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:43:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-04-01 04:43:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-04-01 04:43:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-04-01 04:43:50,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2023-04-01 04:43:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:43:50,142 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-04-01 04:43:50,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-04-01 04:43:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 04:43:50,143 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:50,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:50,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 04:43:50,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:50,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash -141612717, now seen corresponding path program 1 times [2023-04-01 04:43:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677047913] [2023-04-01 04:43:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:50,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:43:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677047913] [2023-04-01 04:43:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677047913] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:43:50,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306888543] [2023-04-01 04:43:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:50,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:43:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:43:50,205 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-04-01 04:43:50,206 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-04-01 04:43:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:50,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 04:43:50,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:43:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:50,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:43:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:50,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306888543] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:43:50,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1571710630] [2023-04-01 04:43:50,377 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-04-01 04:43:50,377 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:43:50,380 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:43:50,385 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:43:50,385 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:43:50,485 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-01 04:43:50,543 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-01 04:43:50,555 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:43:50,575 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:43:50,801 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '152#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:43:50,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:43:50,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:43:50,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-04-01 04:43:50,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985538681] [2023-04-01 04:43:50,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:43:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 04:43:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:43:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 04:43:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-04-01 04:43:50,805 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:43:50,821 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-04-01 04:43:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 04:43:50,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 04:43:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:43:50,823 INFO L225 Difference]: With dead ends: 20 [2023-04-01 04:43:50,823 INFO L226 Difference]: Without dead ends: 15 [2023-04-01 04:43:50,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-04-01 04:43:50,825 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:43:50,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:43:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-04-01 04:43:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-04-01 04:43:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2023-04-01 04:43:50,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2023-04-01 04:43:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:43:50,829 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2023-04-01 04:43:50,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2023-04-01 04:43:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 04:43:50,830 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:50,830 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:50,840 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-04-01 04:43:51,037 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-04-01 04:43:51,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:51,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1524193372, now seen corresponding path program 2 times [2023-04-01 04:43:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912905434] [2023-04-01 04:43:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:51,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:43:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912905434] [2023-04-01 04:43:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912905434] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:43:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143345121] [2023-04-01 04:43:51,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:43:51,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:43:51,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:43:51,189 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-04-01 04:43:51,197 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-04-01 04:43:51,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 04:43:51,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:43:51,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 04:43:51,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:43:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:51,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:43:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143345121] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:43:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1483455041] [2023-04-01 04:43:51,339 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-04-01 04:43:51,340 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:43:51,340 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:43:51,340 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:43:51,340 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:43:51,374 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-01 04:43:51,422 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-01 04:43:51,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:43:51,453 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:43:51,621 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '313#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:43:51,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:43:51,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:43:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-04-01 04:43:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041598180] [2023-04-01 04:43:51,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:43:51,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 04:43:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:43:51,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 04:43:51,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-04-01 04:43:51,625 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:43:51,644 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2023-04-01 04:43:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 04:43:51,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-01 04:43:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:43:51,645 INFO L225 Difference]: With dead ends: 26 [2023-04-01 04:43:51,646 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 04:43:51,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-04-01 04:43:51,647 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:43:51,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:43:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 04:43:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 04:43:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2023-04-01 04:43:51,653 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2023-04-01 04:43:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:43:51,653 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2023-04-01 04:43:51,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2023-04-01 04:43:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 04:43:51,654 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:51,654 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:51,666 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-04-01 04:43:51,859 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-04-01 04:43:51,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:51,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1544226492, now seen corresponding path program 3 times [2023-04-01 04:43:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761419983] [2023-04-01 04:43:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:52,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:43:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761419983] [2023-04-01 04:43:52,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761419983] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:43:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3600444] [2023-04-01 04:43:52,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 04:43:52,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:43:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:43:52,112 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-04-01 04:43:52,116 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-04-01 04:43:52,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 04:43:52,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:43:52,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 04:43:52,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:43:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:52,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:43:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3600444] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:43:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715554628] [2023-04-01 04:43:52,449 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-04-01 04:43:52,449 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:43:52,450 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:43:52,450 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:43:52,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:43:52,473 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-01 04:43:52,492 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-01 04:43:52,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:43:52,502 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:43:52,657 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '546#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:43:52,657 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:43:52,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:43:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-04-01 04:43:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827882475] [2023-04-01 04:43:52,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:43:52,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 04:43:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:43:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 04:43:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=730, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 04:43:52,660 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:43:52,692 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-04-01 04:43:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 04:43:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-04-01 04:43:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:43:52,694 INFO L225 Difference]: With dead ends: 38 [2023-04-01 04:43:52,694 INFO L226 Difference]: Without dead ends: 33 [2023-04-01 04:43:52,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=730, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 04:43:52,696 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:43:52,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:43:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-04-01 04:43:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-04-01 04:43:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2023-04-01 04:43:52,702 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2023-04-01 04:43:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:43:52,702 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2023-04-01 04:43:52,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2023-04-01 04:43:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-01 04:43:52,703 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:52,703 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:52,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 04:43:52,913 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-04-01 04:43:52,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:52,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2041083012, now seen corresponding path program 4 times [2023-04-01 04:43:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709710384] [2023-04-01 04:43:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:53,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:43:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709710384] [2023-04-01 04:43:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709710384] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:43:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401649343] [2023-04-01 04:43:53,354 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 04:43:53,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:43:53,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:43:53,356 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-04-01 04:43:53,360 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-04-01 04:43:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:53,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-01 04:43:53,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:43:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:53,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:43:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401649343] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:43:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806347312] [2023-04-01 04:43:54,169 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-04-01 04:43:54,170 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:43:54,170 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:43:54,170 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:43:54,170 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:43:54,193 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-01 04:43:54,211 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-01 04:43:54,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:43:54,221 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:43:54,439 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '923#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:43:54,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:43:54,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:43:54,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-04-01 04:43:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082490062] [2023-04-01 04:43:54,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:43:54,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-04-01 04:43:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:43:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-04-01 04:43:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1202, Invalid=1990, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 04:43:54,443 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:43:54,506 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-04-01 04:43:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-04-01 04:43:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-04-01 04:43:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:43:54,508 INFO L225 Difference]: With dead ends: 62 [2023-04-01 04:43:54,508 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 04:43:54,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1202, Invalid=1990, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 04:43:54,510 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:43:54,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:43:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 04:43:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-04-01 04:43:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2023-04-01 04:43:54,518 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2023-04-01 04:43:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:43:54,518 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2023-04-01 04:43:54,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2023-04-01 04:43:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-04-01 04:43:54,520 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:54,520 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:54,532 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-04-01 04:43:54,728 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-04-01 04:43:54,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:54,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -578630908, now seen corresponding path program 5 times [2023-04-01 04:43:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137189160] [2023-04-01 04:43:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:43:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:56,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:43:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137189160] [2023-04-01 04:43:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137189160] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:43:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456964505] [2023-04-01 04:43:56,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 04:43:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:43:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:43:56,025 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-04-01 04:43:56,029 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-04-01 04:43:56,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2023-04-01 04:43:56,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:43:56,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 48 conjunts are in the unsatisfiable core [2023-04-01 04:43:56,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:43:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:56,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:43:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:43:58,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456964505] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:43:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589733914] [2023-04-01 04:43:58,639 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-04-01 04:43:58,639 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:43:58,639 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:43:58,640 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:43:58,640 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:43:58,677 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-01 04:43:58,702 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-01 04:43:58,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:43:58,714 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:43:58,985 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1588#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:43:58,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:43:58,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:43:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-04-01 04:43:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924620103] [2023-04-01 04:43:58,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:43:58,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-04-01 04:43:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:43:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-04-01 04:43:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4682, Invalid=6238, Unknown=0, NotChecked=0, Total=10920 [2023-04-01 04:43:58,993 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:43:59,139 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2023-04-01 04:43:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-04-01 04:43:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-04-01 04:43:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:43:59,143 INFO L225 Difference]: With dead ends: 110 [2023-04-01 04:43:59,143 INFO L226 Difference]: Without dead ends: 105 [2023-04-01 04:43:59,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4682, Invalid=6238, Unknown=0, NotChecked=0, Total=10920 [2023-04-01 04:43:59,148 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:43:59,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:43:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-04-01 04:43:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-04-01 04:43:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2023-04-01 04:43:59,174 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2023-04-01 04:43:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:43:59,176 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2023-04-01 04:43:59,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:43:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2023-04-01 04:43:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-04-01 04:43:59,181 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:43:59,181 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:43:59,191 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-04-01 04:43:59,388 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-04-01 04:43:59,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:43:59,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:43:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1413154812, now seen corresponding path program 6 times [2023-04-01 04:43:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:43:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069278341] [2023-04-01 04:43:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:43:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:43:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:44:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:44:03,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:44:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069278341] [2023-04-01 04:44:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069278341] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:44:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954985634] [2023-04-01 04:44:03,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 04:44:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:44:03,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:44:03,724 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-04-01 04:44:03,727 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-04-01 04:44:03,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 04:44:03,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 04:44:03,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 96 conjunts are in the unsatisfiable core [2023-04-01 04:44:03,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:44:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:44:04,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:44:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:44:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954985634] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:44:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757281937] [2023-04-01 04:44:07,506 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-04-01 04:44:07,506 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:44:07,506 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:44:07,507 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:44:07,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:44:07,526 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-01 04:44:07,545 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-01 04:44:07,550 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:44:07,554 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:44:07,945 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2739#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 04:44:07,945 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:44:07,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:44:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2023-04-01 04:44:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857161259] [2023-04-01 04:44:07,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:44:07,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-04-01 04:44:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:44:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-04-01 04:44:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5279, Invalid=6931, Unknown=0, NotChecked=0, Total=12210 [2023-04-01 04:44:07,952 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 103 states, 103 states have (on average 1.058252427184466) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:44:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:44:08,095 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2023-04-01 04:44:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-04-01 04:44:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.058252427184466) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2023-04-01 04:44:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:44:08,097 INFO L225 Difference]: With dead ends: 116 [2023-04-01 04:44:08,097 INFO L226 Difference]: Without dead ends: 111 [2023-04-01 04:44:08,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 209 SyntacticMatches, 90 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5677 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5279, Invalid=6931, Unknown=0, NotChecked=0, Total=12210 [2023-04-01 04:44:08,101 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:44:08,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:44:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-04-01 04:44:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-04-01 04:44:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:44:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2023-04-01 04:44:08,110 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 104 [2023-04-01 04:44:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:44:08,110 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2023-04-01 04:44:08,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.058252427184466) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:44:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2023-04-01 04:44:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-04-01 04:44:08,112 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:44:08,112 INFO L195 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:44:08,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 04:44:08,318 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-04-01 04:44:08,319 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 04:44:08,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:44:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2064809564, now seen corresponding path program 7 times [2023-04-01 04:44:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:44:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136564873] [2023-04-01 04:44:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:44:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:44:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 04:44:08,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 04:44:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 04:44:08,499 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 04:44:08,500 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 04:44:08,501 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 04:44:08,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-01 04:44:08,506 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1] [2023-04-01 04:44:08,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 04:44:08,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 04:44:08 BoogieIcfgContainer [2023-04-01 04:44:08,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 04:44:08,611 INFO L158 Benchmark]: Toolchain (without parser) took 19468.83ms. Allocated memory was 338.7MB in the beginning and 488.6MB in the end (delta: 149.9MB). Free memory was 291.6MB in the beginning and 221.9MB in the end (delta: 69.8MB). Peak memory consumption was 221.2MB. Max. memory is 8.0GB. [2023-04-01 04:44:08,611 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 04:44:08,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.27ms. Allocated memory is still 338.7MB. Free memory was 291.1MB in the beginning and 281.1MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-04-01 04:44:08,611 INFO L158 Benchmark]: Boogie Preprocessor took 27.97ms. Allocated memory is still 338.7MB. Free memory was 281.1MB in the beginning and 280.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 04:44:08,612 INFO L158 Benchmark]: RCFGBuilder took 282.96ms. Allocated memory is still 338.7MB. Free memory was 280.1MB in the beginning and 267.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-01 04:44:08,612 INFO L158 Benchmark]: TraceAbstraction took 18976.58ms. Allocated memory was 338.7MB in the beginning and 488.6MB in the end (delta: 149.9MB). Free memory was 267.0MB in the beginning and 221.9MB in the end (delta: 45.1MB). Peak memory consumption was 196.1MB. Max. memory is 8.0GB. [2023-04-01 04:44:08,614 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 185.6MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.27ms. Allocated memory is still 338.7MB. Free memory was 291.1MB in the beginning and 281.1MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.97ms. Allocated memory is still 338.7MB. Free memory was 281.1MB in the beginning and 280.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.96ms. Allocated memory is still 338.7MB. Free memory was 280.1MB in the beginning and 267.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18976.58ms. Allocated memory was 338.7MB in the beginning and 488.6MB in the end (delta: 149.9MB). Free memory was 267.0MB in the beginning and 221.9MB in the end (delta: 45.1MB). Peak memory consumption was 196.1MB. 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: 12]: 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 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=1, x0=181, x1=113, x2=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=2, x0=113, x1=167, x2=167] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=3, x0=167, x1=182, x2=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=4, x0=182, x1=112, x2=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=5, x0=112, x1=123, x2=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=6, x0=123, x1=110, x2=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=7, x0=110, x1=177, x2=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=8, x0=177, x1=158, x2=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=9, x0=158, x1=120, x2=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=10, x0=120, x1=178, x2=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=11, x0=178, x1=164, x2=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=12, x0=164, x1=129, x2=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=13, x0=129, x1=128, x2=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=14, x0=128, x1=140, x2=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=15, x0=140, x1=153, x2=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=16, x0=153, x1=176, x2=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=17, x0=176, x1=145, x2=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=18, x0=145, x1=205, x2=205] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=19, x0=205, x1=118, x2=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=20, x0=118, x1=126, x2=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=21, x0=126, x1=155, x2=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=22, x0=155, x1=150, x2=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=23, x0=150, x1=173, x2=173] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=24, x0=173, x1=197, x2=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=25, x0=197, x1=165, x2=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=26, x0=165, x1=108, x2=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=27, x0=108, x1=186, x2=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=28, x0=186, x1=159, x2=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=29, x0=159, x1=127, x2=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=30, x0=127, x1=174, x2=174] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=31, x0=174, x1=206, x2=206] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=32, x0=206, x1=125, x2=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=33, x0=125, x1=194, x2=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=34, x0=194, x1=187, x2=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=35, x0=187, x1=179, x2=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=36, x0=179, x1=147, x2=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=37, x0=147, x1=149, x2=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=38, x0=149, x1=117, x2=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=39, x0=117, x1=199, x2=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=40, x0=199, x1=198, x2=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=41, x0=198, x1=124, x2=124] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=42, x0=124, x1=154, x2=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=43, x0=154, x1=156, x2=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=44, x0=156, x1=107, x2=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=45, x0=107, x1=190, x2=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=46, x0=190, x1=141, x2=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=47, x0=141, x1=202, x2=202] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=48, x0=202, x1=201, x2=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=49, x0=201, x1=111, x2=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=50, x0=111, x1=139, x2=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=51, x0=139, x1=171, x2=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=52, x0=171, x1=121, x2=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=53, x0=121, x1=175, x2=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=54, x0=175, x1=134, x2=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=55, x0=134, x1=168, x2=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=56, x0=168, x1=130, x2=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=57, x0=130, x1=162, x2=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=58, x0=162, x1=170, x2=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=59, x0=170, x1=146, x2=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=60, x0=146, x1=138, x2=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=61, x0=138, x1=109, x2=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=62, x0=109, x1=172, x2=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=63, x0=172, x1=122, x2=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=64, x0=122, x1=169, x2=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=65, x0=169, x1=191, x2=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=66, x0=191, x1=207, x2=207] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=67, x0=207, x1=161, x2=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=68, x0=161, x1=183, x2=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=69, x0=183, x1=163, x2=163] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=70, x0=163, x1=116, x2=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=71, x0=116, x1=188, x2=188] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=72, x0=188, x1=132, x2=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=73, x0=132, x1=119, x2=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=74, x0=119, x1=184, x2=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=75, x0=184, x1=185, x2=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=76, x0=185, x1=151, x2=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=77, x0=151, x1=160, x2=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=78, x0=160, x1=189, x2=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=79, x0=189, x1=114, x2=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=80, x0=114, x1=115, x2=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=81, x0=115, x1=192, x2=192] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=82, x0=192, x1=193, x2=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=83, x0=193, x1=135, x2=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=84, x0=135, x1=137, x2=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=85, x0=137, x1=196, x2=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=86, x0=196, x1=136, x2=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=87, x0=136, x1=142, x2=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=88, x0=142, x1=166, x2=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=89, x0=166, x1=157, x2=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=90, x0=157, x1=195, x2=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=91, x0=195, x1=131, x2=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=92, x0=131, x1=200, x2=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=93, x0=200, x1=148, x2=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=94, x0=148, x1=203, x2=203] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=95, x0=203, x1=144, x2=144] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=96, x0=144, x1=180, x2=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=97, x0=180, x1=204, x2=204] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=98, x0=204, x1=133, x2=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=99, x0=133, x1=152, x2=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=100, x0=152, x1=143, x2=143] [L21] COND FALSE !(i < 100) VAL [i=100, x0=152, x1=143, x2=143] [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) VAL [\old(cond)=0] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 61 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 903 GetRequests, 482 SyntacticMatches, 90 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8151 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=7, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 702 ConstructedInterpolants, 0 QuantifiedInterpolants, 1802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1539 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/17595 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-04-01 04:44:08,642 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...