/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/nla-digbench-scaling/fermat2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 22:59:45,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 22:59:45,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 22:59:45,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 22:59:45,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 22:59:45,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 22:59:45,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 22:59:45,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 22:59:45,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 22:59:45,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 22:59:45,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 22:59:45,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 22:59:45,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 22:59:45,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 22:59:45,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 22:59:45,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 22:59:45,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 22:59:45,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 22:59:45,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 22:59:45,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 22:59:45,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 22:59:45,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 22:59:45,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 22:59:45,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 22:59:45,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 22:59:45,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 22:59:45,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 22:59:45,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 22:59:45,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 22:59:45,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 22:59:45,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 22:59:45,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 22:59:45,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 22:59:45,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 22:59:45,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 22:59:45,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 22:59:45,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 22:59:45,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 22:59:45,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 22:59:45,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 22:59:45,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 22:59:45,377 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-02 22:59:45,407 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 22:59:45,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 22:59:45,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 22:59:45,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 22:59:45,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 22:59:45,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 22:59:45,409 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 22:59:45,409 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 22:59:45,409 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 22:59:45,410 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 22:59:45,410 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 22:59:45,410 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 22:59:45,410 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 22:59:45,411 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 22:59:45,411 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 22:59:45,411 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 22:59:45,411 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 22:59:45,411 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 22:59:45,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 22:59:45,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 22:59:45,413 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 22:59:45,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 22:59:45,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 22:59:45,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 22:59:45,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:59:45,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 22:59:45,413 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 22:59:45,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 22:59:45,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 22:59:45,414 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 22:59:45,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 22:59:45,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 22:59:45,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 22:59:45,414 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-02 22:59:45,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 22:59:45,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 22:59:45,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 22:59:45,606 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 22:59:45,606 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 22:59:45,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2023-04-02 22:59:46,759 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 22:59:46,929 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 22:59:46,930 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2023-04-02 22:59:46,935 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0633347ce/a25eca0bb46a4cc480537de3c97d2afc/FLAGc1abf911c [2023-04-02 22:59:46,952 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0633347ce/a25eca0bb46a4cc480537de3c97d2afc [2023-04-02 22:59:46,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 22:59:46,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 22:59:46,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 22:59:46,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 22:59:46,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 22:59:46,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:59:46" (1/1) ... [2023-04-02 22:59:46,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a81411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:46, skipping insertion in model container [2023-04-02 22:59:46,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 10:59:46" (1/1) ... [2023-04-02 22:59:46,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 22:59:46,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 22:59:47,081 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/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2023-04-02 22:59:47,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:59:47,101 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 22:59:47,108 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/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2023-04-02 22:59:47,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 22:59:47,124 INFO L208 MainTranslator]: Completed translation [2023-04-02 22:59:47,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47 WrapperNode [2023-04-02 22:59:47,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 22:59:47,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 22:59:47,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 22:59:47,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 22:59:47,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 22:59:47,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 22:59:47,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 22:59:47,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 22:59:47,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (1/1) ... [2023-04-02 22:59:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 22:59:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:47,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 22:59:47,182 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-02 22:59:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 22:59:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 22:59:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 22:59:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 22:59:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 22:59:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 22:59:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 22:59:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 22:59:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 22:59:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 22:59:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 22:59:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 22:59:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 22:59:47,263 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 22:59:47,265 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 22:59:47,440 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 22:59:47,465 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 22:59:47,466 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 22:59:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:59:47 BoogieIcfgContainer [2023-04-02 22:59:47,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 22:59:47,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 22:59:47,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 22:59:47,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 22:59:47,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 10:59:46" (1/3) ... [2023-04-02 22:59:47,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d7da0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:59:47, skipping insertion in model container [2023-04-02 22:59:47,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 10:59:47" (2/3) ... [2023-04-02 22:59:47,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d7da0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 10:59:47, skipping insertion in model container [2023-04-02 22:59:47,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 10:59:47" (3/3) ... [2023-04-02 22:59:47,475 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2023-04-02 22:59:47,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 22:59:47,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 22:59:47,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 22:59:47,530 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;@77129bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 22:59:47,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 22:59:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 22:59:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 22:59:47,540 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:47,540 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:47,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:47,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1539655439, now seen corresponding path program 1 times [2023-04-02 22:59:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481520220] [2023-04-02 22:59:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:47,664 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121564460] [2023-04-02 22:59:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:47,697 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-02 22:59:47,705 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-02 22:59:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:59:47,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-02 22:59:47,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:47,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:59:47,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481520220] [2023-04-02 22:59:47,822 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121564460] [2023-04-02 22:59:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121564460] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:59:47,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:59:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 22:59:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126275349] [2023-04-02 22:59:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:59:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 22:59:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 22:59:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 22:59:47,855 INFO L87 Difference]: Start difference. First operand has 25 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:59:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:47,878 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-04-02 22:59:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 22:59:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 17 [2023-04-02 22:59:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:47,886 INFO L225 Difference]: With dead ends: 40 [2023-04-02 22:59:47,886 INFO L226 Difference]: Without dead ends: 21 [2023-04-02 22:59:47,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 22:59:47,892 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:47,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:59:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-02 22:59:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-02 22:59:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 22:59:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-04-02 22:59:47,942 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2023-04-02 22:59:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:47,943 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-04-02 22:59:47,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:59:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-04-02 22:59:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 22:59:47,945 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:47,945 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:47,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-02 22:59:48,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-02 22:59:48,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:48,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -98483365, now seen corresponding path program 1 times [2023-04-02 22:59:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:48,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188843800] [2023-04-02 22:59:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:48,170 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916644294] [2023-04-02 22:59:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:48,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:48,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:48,176 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-02 22:59:48,179 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-02 22:59:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:59:48,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 22:59:48,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:48,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:59:48,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188843800] [2023-04-02 22:59:48,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:48,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916644294] [2023-04-02 22:59:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916644294] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:59:48,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:59:48,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 22:59:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696798126] [2023-04-02 22:59:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:59:48,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 22:59:48,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 22:59:48,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:59:48,309 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 22:59:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:48,325 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-04-02 22:59:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 22:59:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2023-04-02 22:59:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:48,327 INFO L225 Difference]: With dead ends: 30 [2023-04-02 22:59:48,327 INFO L226 Difference]: Without dead ends: 23 [2023-04-02 22:59:48,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 22:59:48,329 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:48,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:59:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-02 22:59:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-02 22:59:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 22:59:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-04-02 22:59:48,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2023-04-02 22:59:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:48,339 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-04-02 22:59:48,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 22:59:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-04-02 22:59:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 22:59:48,340 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:48,340 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:48,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 22:59:48,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-04-02 22:59:48,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:48,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -96695905, now seen corresponding path program 1 times [2023-04-02 22:59:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943784362] [2023-04-02 22:59:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:48,568 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865329525] [2023-04-02 22:59:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:48,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:48,576 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-02 22:59:48,577 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-02 22:59:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:59:48,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-02 22:59:48,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:48,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 22:59:48,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943784362] [2023-04-02 22:59:48,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865329525] [2023-04-02 22:59:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865329525] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 22:59:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 22:59:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 22:59:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830382756] [2023-04-02 22:59:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 22:59:48,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 22:59:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 22:59:48,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 22:59:48,842 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:59:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:49,230 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-04-02 22:59:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 22:59:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2023-04-02 22:59:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:49,231 INFO L225 Difference]: With dead ends: 32 [2023-04-02 22:59:49,231 INFO L226 Difference]: Without dead ends: 30 [2023-04-02 22:59:49,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 22:59:49,233 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:49,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 22:59:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-02 22:59:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-04-02 22:59:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 22:59:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-04-02 22:59:49,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2023-04-02 22:59:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:49,241 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-04-02 22:59:49,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 22:59:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-04-02 22:59:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 22:59:49,242 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:49,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:49,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 22:59:49,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:49,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:49,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -353290452, now seen corresponding path program 1 times [2023-04-02 22:59:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227015857] [2023-04-02 22:59:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:49,460 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273596831] [2023-04-02 22:59:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:49,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:49,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:49,462 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-02 22:59:49,466 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-02 22:59:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:59:49,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 22:59:49,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:49,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:59:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:49,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:49,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227015857] [2023-04-02 22:59:49,707 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273596831] [2023-04-02 22:59:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273596831] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:59:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129842466] [2023-04-02 22:59:49,729 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:59:49,730 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:59:49,733 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:59:49,745 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:59:49,746 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:59:49,840 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:59:50,273 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2023-04-02 22:59:50,293 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:59:50,297 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:59:50,305 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:59:50,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '598#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= ~counter~0 1) (= |#NULL.base| 0))' at error location [2023-04-02 22:59:50,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:59:50,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:59:50,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-04-02 22:59:50,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473478594] [2023-04-02 22:59:50,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:59:50,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 22:59:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 22:59:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2023-04-02 22:59:50,874 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2023-04-02 22:59:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:51,044 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-04-02 22:59:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 22:59:51,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2023-04-02 22:59:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:51,046 INFO L225 Difference]: With dead ends: 35 [2023-04-02 22:59:51,046 INFO L226 Difference]: Without dead ends: 30 [2023-04-02 22:59:51,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2023-04-02 22:59:51,047 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:51,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:59:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-02 22:59:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-04-02 22:59:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 22:59:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-04-02 22:59:51,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2023-04-02 22:59:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:51,055 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-04-02 22:59:51,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2023-04-02 22:59:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-04-02 22:59:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-02 22:59:51,056 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:51,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:51,063 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-02 22:59:51,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:51,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:51,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1507720734, now seen corresponding path program 1 times [2023-04-02 22:59:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847497478] [2023-04-02 22:59:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:51,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:51,286 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:51,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571192810] [2023-04-02 22:59:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:51,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:51,294 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-02 22:59:51,295 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-02 22:59:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:59:51,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 22:59:51,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:51,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:59:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:51,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847497478] [2023-04-02 22:59:51,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571192810] [2023-04-02 22:59:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571192810] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:59:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1740688294] [2023-04-02 22:59:51,436 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:59:51,437 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:59:51,437 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:59:51,437 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:59:51,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:59:51,467 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:59:51,984 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2023-04-02 22:59:52,003 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:59:52,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:59:52,009 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:59:52,709 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '870#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:59:52,709 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:59:52,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:59:52,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 22:59:52,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617974343] [2023-04-02 22:59:52,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:59:52,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 22:59:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:52,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 22:59:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-04-02 22:59:52,711 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-02 22:59:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:52,785 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-04-02 22:59:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 22:59:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 26 [2023-04-02 22:59:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:52,788 INFO L225 Difference]: With dead ends: 54 [2023-04-02 22:59:52,788 INFO L226 Difference]: Without dead ends: 49 [2023-04-02 22:59:52,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-04-02 22:59:52,789 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:52,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 71 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 22:59:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-02 22:59:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-04-02 22:59:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 22:59:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2023-04-02 22:59:52,804 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 26 [2023-04-02 22:59:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:52,804 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2023-04-02 22:59:52,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-02 22:59:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2023-04-02 22:59:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-02 22:59:52,807 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:52,807 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:52,819 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-02 22:59:53,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:53,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:53,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash -548963225, now seen corresponding path program 2 times [2023-04-02 22:59:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881675213] [2023-04-02 22:59:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:53,029 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227218919] [2023-04-02 22:59:53,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 22:59:53,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:53,031 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-02 22:59:53,034 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-02 22:59:53,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-02 22:59:53,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:59:53,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 22:59:53,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:53,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:59:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-02 22:59:53,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881675213] [2023-04-02 22:59:53,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227218919] [2023-04-02 22:59:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227218919] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:59:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [653467822] [2023-04-02 22:59:53,320 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:59:53,321 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:59:53,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:59:53,321 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:59:53,321 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:59:53,343 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:59:53,724 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2023-04-02 22:59:53,742 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:59:53,744 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:59:53,747 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:59:54,530 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1351#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:59:54,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:59:54,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:59:54,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 22:59:54,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869794538] [2023-04-02 22:59:54,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:59:54,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 22:59:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 22:59:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2023-04-02 22:59:54,532 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 22:59:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:54,742 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-04-02 22:59:54,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 22:59:54,743 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 50 [2023-04-02 22:59:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:54,744 INFO L225 Difference]: With dead ends: 102 [2023-04-02 22:59:54,744 INFO L226 Difference]: Without dead ends: 97 [2023-04-02 22:59:54,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2023-04-02 22:59:54,746 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:54,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 77 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 22:59:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-02 22:59:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-04-02 22:59:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-02 22:59:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2023-04-02 22:59:54,778 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 50 [2023-04-02 22:59:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:54,780 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2023-04-02 22:59:54,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 22:59:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2023-04-02 22:59:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-04-02 22:59:54,786 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:54,786 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:54,799 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-02 22:59:54,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:54,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:54,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1194371079, now seen corresponding path program 3 times [2023-04-02 22:59:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301485502] [2023-04-02 22:59:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:55,025 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81232153] [2023-04-02 22:59:55,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 22:59:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:55,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:59:55,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 22:59:55,279 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 22:59:55,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 22:59:55,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 22:59:55,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:55,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:59:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-04-02 22:59:55,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301485502] [2023-04-02 22:59:55,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81232153] [2023-04-02 22:59:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81232153] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:59:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426471849] [2023-04-02 22:59:55,746 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:59:55,746 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:59:55,747 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:59:55,747 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:59:55,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:59:55,764 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:59:56,104 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2023-04-02 22:59:56,117 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:59:56,118 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:59:56,122 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 22:59:57,018 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2276#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 22:59:57,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 22:59:57,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 22:59:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-04-02 22:59:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139919943] [2023-04-02 22:59:57,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 22:59:57,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-02 22:59:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 22:59:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-02 22:59:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 22:59:57,023 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2023-04-02 22:59:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 22:59:57,552 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2023-04-02 22:59:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-02 22:59:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 98 [2023-04-02 22:59:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 22:59:57,554 INFO L225 Difference]: With dead ends: 198 [2023-04-02 22:59:57,554 INFO L226 Difference]: Without dead ends: 193 [2023-04-02 22:59:57,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 244 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=975, Invalid=2807, Unknown=0, NotChecked=0, Total=3782 [2023-04-02 22:59:57,557 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 110 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 22:59:57,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 135 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 22:59:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-04-02 22:59:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-04-02 22:59:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-04-02 22:59:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2023-04-02 22:59:57,586 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 98 [2023-04-02 22:59:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 22:59:57,588 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2023-04-02 22:59:57,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2023-04-02 22:59:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2023-04-02 22:59:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-04-02 22:59:57,596 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 22:59:57,596 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 22:59:57,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-02 22:59:57,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:57,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 22:59:57,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 22:59:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1896778525, now seen corresponding path program 4 times [2023-04-02 22:59:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 22:59:57,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788766719] [2023-04-02 22:59:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 22:59:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 22:59:57,825 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 22:59:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432308473] [2023-04-02 22:59:57,826 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 22:59:57,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 22:59:57,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 22:59:57,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 22:59:57,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 22:59:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 22:59:57,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-02 22:59:57,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 22:59:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 22:59:58,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 22:59:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2023-04-02 22:59:59,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 22:59:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788766719] [2023-04-02 22:59:59,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 22:59:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432308473] [2023-04-02 22:59:59,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432308473] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 22:59:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1244581885] [2023-04-02 22:59:59,185 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 22:59:59,185 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 22:59:59,185 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 22:59:59,185 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 22:59:59,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 22:59:59,213 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 22:59:59,541 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2023-04-02 22:59:59,553 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 22:59:59,554 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 22:59:59,558 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:00:00,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4089#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 23:00:00,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:00:00,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:00:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-04-02 23:00:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512500959] [2023-04-02 23:00:00,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:00:00,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-04-02 23:00:00,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:00:00,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-04-02 23:00:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2704, Unknown=0, NotChecked=0, Total=4160 [2023-04-02 23:00:00,877 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2023-04-02 23:00:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:00:02,370 INFO L93 Difference]: Finished difference Result 390 states and 414 transitions. [2023-04-02 23:00:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-04-02 23:00:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 194 [2023-04-02 23:00:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:00:02,374 INFO L225 Difference]: With dead ends: 390 [2023-04-02 23:00:02,374 INFO L226 Difference]: Without dead ends: 385 [2023-04-02 23:00:02,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 496 SyntacticMatches, 22 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3639, Invalid=8351, Unknown=0, NotChecked=0, Total=11990 [2023-04-02 23:00:02,378 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 200 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 23:00:02,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 205 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 23:00:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-04-02 23:00:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2023-04-02 23:00:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 285 states have (on average 1.0035087719298246) internal successors, (286), 285 states have internal predecessors, (286), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-04-02 23:00:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2023-04-02 23:00:02,444 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 194 [2023-04-02 23:00:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:00:02,445 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2023-04-02 23:00:02,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2023-04-02 23:00:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2023-04-02 23:00:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2023-04-02 23:00:02,450 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:00:02,450 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:00:02,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 23:00:02,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-04-02 23:00:02,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:00:02,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:00:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1898635621, now seen corresponding path program 5 times [2023-04-02 23:00:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:00:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366583770] [2023-04-02 23:00:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:00:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:00:02,684 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:00:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594639890] [2023-04-02 23:00:02,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 23:00:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:00:02,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:00:02,686 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:00:02,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 23:01:05,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2023-04-02 23:01:05,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 23:01:05,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 97 conjunts are in the unsatisfiable core [2023-04-02 23:01:05,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:01:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:01:06,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:01:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2023-04-02 23:01:08,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:01:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366583770] [2023-04-02 23:01:08,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:01:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594639890] [2023-04-02 23:01:08,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594639890] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:01:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1204429514] [2023-04-02 23:01:08,191 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:01:08,191 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:01:08,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:01:08,192 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:01:08,192 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:01:08,213 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:01:08,504 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 20 for LOIs [2023-04-02 23:01:08,516 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:01:08,517 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:01:08,520 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:01:11,668 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7634#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 23:01:11,668 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:01:11,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:01:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2023-04-02 23:01:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570610051] [2023-04-02 23:01:11,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:01:11,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-04-02 23:01:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:01:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-04-02 23:01:11,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1678, Invalid=3014, Unknown=0, NotChecked=0, Total=4692 [2023-04-02 23:01:11,675 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2023-04-02 23:01:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:01:13,127 INFO L93 Difference]: Finished difference Result 422 states and 426 transitions. [2023-04-02 23:01:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-04-02 23:01:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 386 [2023-04-02 23:01:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:01:13,137 INFO L225 Difference]: With dead ends: 422 [2023-04-02 23:01:13,137 INFO L226 Difference]: Without dead ends: 417 [2023-04-02 23:01:13,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 999 SyntacticMatches, 91 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6864 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4273, Invalid=9533, Unknown=0, NotChecked=0, Total=13806 [2023-04-02 23:01:13,143 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 23:01:13,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 239 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 23:01:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-04-02 23:01:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-04-02 23:01:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 309 states have (on average 1.0032362459546926) internal successors, (310), 309 states have internal predecessors, (310), 55 states have call successors, (55), 54 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-04-02 23:01:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2023-04-02 23:01:13,199 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 386 [2023-04-02 23:01:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:01:13,200 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2023-04-02 23:01:13,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2023-04-02 23:01:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2023-04-02 23:01:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2023-04-02 23:01:13,207 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:01:13,207 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:01:13,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 23:01:13,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:01:13,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:01:13,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:01:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 46559857, now seen corresponding path program 6 times [2023-04-02 23:01:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:01:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842201964] [2023-04-02 23:01:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:01:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:01:13,464 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:01:13,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777148906] [2023-04-02 23:01:13,465 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 23:01:13,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:01:13,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:01:13,466 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:01:13,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 23:01:19,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 23:01:19,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-02 23:01:19,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 23:01:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 23:01:20,872 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-02 23:01:20,872 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 23:01:20,873 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 23:01:20,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 23:01:21,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 23:01:21,089 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2023-04-02 23:01:21,093 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 23:01:21,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 11:01:21 BoogieIcfgContainer [2023-04-02 23:01:21,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 23:01:21,216 INFO L158 Benchmark]: Toolchain (without parser) took 94261.07ms. Allocated memory was 188.7MB in the beginning and 458.2MB in the end (delta: 269.5MB). Free memory was 139.4MB in the beginning and 410.3MB in the end (delta: -270.9MB). Peak memory consumption was 254.4MB. Max. memory is 8.0GB. [2023-04-02 23:01:21,217 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 23:01:21,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.36ms. Allocated memory is still 188.7MB. Free memory was 139.1MB in the beginning and 128.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 23:01:21,217 INFO L158 Benchmark]: Boogie Preprocessor took 21.63ms. Allocated memory is still 188.7MB. Free memory was 128.6MB in the beginning and 127.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 23:01:21,217 INFO L158 Benchmark]: RCFGBuilder took 320.78ms. Allocated memory is still 188.7MB. Free memory was 127.2MB in the beginning and 114.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 23:01:21,217 INFO L158 Benchmark]: TraceAbstraction took 93746.33ms. Allocated memory was 188.7MB in the beginning and 458.2MB in the end (delta: 269.5MB). Free memory was 113.6MB in the beginning and 410.3MB in the end (delta: -296.7MB). Peak memory consumption was 228.2MB. Max. memory is 8.0GB. [2023-04-02 23:01:21,218 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 188.7MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.36ms. Allocated memory is still 188.7MB. Free memory was 139.1MB in the beginning and 128.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.63ms. Allocated memory is still 188.7MB. Free memory was 128.6MB in the beginning and 127.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 320.78ms. Allocated memory is still 188.7MB. Free memory was 127.2MB in the beginning and 114.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 93746.33ms. Allocated memory was 188.7MB in the beginning and 458.2MB in the end (delta: 269.5MB). Free memory was 113.6MB in the beginning and 410.3MB in the end (delta: -296.7MB). Peak memory consumption was 228.2MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=12101, R=104, \old(counter)=0, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=12101, R=104, \old(counter)=0, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=12101, R=104, \old(counter)=0, counter=0, r=-1285, u=209, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=0, counter=1, r=-1285, u=209, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=1, r=-1285, u=209, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=1, r=-1076, u=211, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=1, counter=2, r=-1076, u=211, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=2, r=-1076, u=211, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=2, r=-865, u=213, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=2, counter=3, r=-865, u=213, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=3, r=-865, u=213, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=3, r=-652, u=215, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=3, counter=4, r=-652, u=215, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=4, r=-652, u=215, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=4, r=-437, u=217, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=4, counter=5, r=-437, u=217, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=5, r=-437, u=217, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=5, r=-220, u=219, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=5, counter=6, r=-220, u=219, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=6, r=-220, u=219, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=6, r=-1, u=221, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=6, counter=7, r=-1, u=221, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=7, r=-1, u=221, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=7, r=220, u=223, v=1] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=7, counter=8, r=220, u=223, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=8, r=220, u=223, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=8, r=219, u=223, v=3] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=8, counter=9, r=219, u=223, v=3] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=9, r=219, u=223, v=3] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=9, r=216, u=223, v=5] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=9, counter=10, r=216, u=223, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=10, r=216, u=223, v=5] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=10, r=211, u=223, v=7] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=10, counter=11, r=211, u=223, v=7] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=11, r=211, u=223, v=7] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=11, r=204, u=223, v=9] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=11, counter=12, r=204, u=223, v=9] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=12, r=204, u=223, v=9] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=12, r=195, u=223, v=11] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=12, counter=13, r=195, u=223, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=13, r=195, u=223, v=11] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=13, r=184, u=223, v=13] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=13, counter=14, r=184, u=223, v=13] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=14, r=184, u=223, v=13] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=14, r=171, u=223, v=15] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=14, counter=15, r=171, u=223, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=15, r=171, u=223, v=15] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=15, r=156, u=223, v=17] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=15, counter=16, r=156, u=223, v=17] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=16, r=156, u=223, v=17] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=16, r=139, u=223, v=19] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=16, counter=17, r=139, u=223, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=17, r=139, u=223, v=19] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=17, r=120, u=223, v=21] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=17, counter=18, r=120, u=223, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=18, r=120, u=223, v=21] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=18, r=99, u=223, v=23] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=18, counter=19, r=99, u=223, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=19, r=99, u=223, v=23] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=19, r=76, u=223, v=25] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=19, counter=20, r=76, u=223, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=20, r=76, u=223, v=25] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=20, r=51, u=223, v=27] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=20, counter=21, r=51, u=223, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=21, r=51, u=223, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=21, r=24, u=223, v=29] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=21, counter=22, r=24, u=223, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=22, r=24, u=223, v=29] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=22, r=-5, u=223, v=31] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=22, counter=23, r=-5, u=223, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=23, r=-5, u=223, v=31] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=23, r=218, u=225, v=31] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=23, counter=24, r=218, u=225, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=24, r=218, u=225, v=31] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=24, r=187, u=225, v=33] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=24, counter=25, r=187, u=225, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=25, r=187, u=225, v=33] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=25, r=154, u=225, v=35] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=25, counter=26, r=154, u=225, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=26, r=154, u=225, v=35] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=26, r=119, u=225, v=37] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=26, counter=27, r=119, u=225, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=27, r=119, u=225, v=37] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=27, r=82, u=225, v=39] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=27, counter=28, r=82, u=225, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=28, r=82, u=225, v=39] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=28, r=43, u=225, v=41] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=28, counter=29, r=43, u=225, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=29, r=43, u=225, v=41] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=29, r=2, u=225, v=43] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=29, counter=30, r=2, u=225, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=30, r=2, u=225, v=43] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=30, r=-41, u=225, v=45] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=30, counter=31, r=-41, u=225, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=31, r=-41, u=225, v=45] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=31, r=184, u=227, v=45] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=31, counter=32, r=184, u=227, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=32, r=184, u=227, v=45] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=32, r=139, u=227, v=47] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=32, counter=33, r=139, u=227, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=33, r=139, u=227, v=47] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=33, r=92, u=227, v=49] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=33, counter=34, r=92, u=227, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=34, r=92, u=227, v=49] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=34, r=43, u=227, v=51] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=34, counter=35, r=43, u=227, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=35, r=43, u=227, v=51] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=35, r=-8, u=227, v=53] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=35, counter=36, r=-8, u=227, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=36, r=-8, u=227, v=53] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=36, r=219, u=229, v=53] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=36, counter=37, r=219, u=229, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=37, r=219, u=229, v=53] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=37, r=166, u=229, v=55] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=37, counter=38, r=166, u=229, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=38, r=166, u=229, v=55] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=38, r=111, u=229, v=57] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=38, counter=39, r=111, u=229, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=39, r=111, u=229, v=57] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=39, r=54, u=229, v=59] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=39, counter=40, r=54, u=229, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=40, r=54, u=229, v=59] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=40, r=-5, u=229, v=61] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=40, counter=41, r=-5, u=229, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=41, r=-5, u=229, v=61] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=41, r=224, u=231, v=61] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=41, counter=42, r=224, u=231, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=42, r=224, u=231, v=61] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=42, r=163, u=231, v=63] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=42, counter=43, r=163, u=231, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=43, r=163, u=231, v=63] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=43, r=100, u=231, v=65] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=43, counter=44, r=100, u=231, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=44, r=100, u=231, v=65] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=44, r=35, u=231, v=67] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=44, counter=45, r=35, u=231, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=45, r=35, u=231, v=67] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=45, r=-32, u=231, v=69] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=45, counter=46, r=-32, u=231, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=46, r=-32, u=231, v=69] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=46, r=199, u=233, v=69] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=46, counter=47, r=199, u=233, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=47, r=199, u=233, v=69] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=47, r=130, u=233, v=71] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=47, counter=48, r=130, u=233, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=48, r=130, u=233, v=71] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=48, r=59, u=233, v=73] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=48, counter=49, r=59, u=233, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=49, r=59, u=233, v=73] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=12101, R=104, \old(counter)=0, counter=49, r=-14, u=233, v=75] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=49, counter=50, r=-14, u=233, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12101, R=104, \old(counter)=0, counter=50, r=-14, u=233, v=75] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=12101, R=104, \old(counter)=0, counter=50, r=219, u=235, v=75] [L34] EXPR counter++ VAL [A=12101, R=104, \old(counter)=0, counter++=50, counter=51, r=219, u=235, v=75] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.6s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 951 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 785 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 856 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 166 mSDtfsCounter, 856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2003 SyntacticMatches, 128 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14013 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=9, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 69.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1249 NumberOfCodeBlocks, 1249 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1594 ConstructedInterpolants, 0 QuantifiedInterpolants, 4008 SizeOfPredicates, 94 NumberOfNonLiveVariables, 2127 ConjunctsInSsa, 222 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5632/21770 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 proved your program to be incorrect! [2023-04-02 23:01:21,279 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...