/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.5-dev-b75d321-m
[2024-11-02 19:56:50,658 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-02 19:56:50,728 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-02 19:56:50,734 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-02 19:56:50,735 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-02 19:56:50,770 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-02 19:56:50,770 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-02 19:56:50,771 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-02 19:56:50,772 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-02 19:56:50,773 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-02 19:56:50,773 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-02 19:56:50,774 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-02 19:56:50,774 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-02 19:56:50,774 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-02 19:56:50,775 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-02 19:56:50,775 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-02 19:56:50,775 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-02 19:56:50,775 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-02 19:56:50,776 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-02 19:56:50,776 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-02 19:56:50,779 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-02 19:56:50,780 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-02 19:56:50,780 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-02 19:56:50,780 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-02 19:56:50,780 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-02 19:56:50,780 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-02 19:56:50,781 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-02 19:56:50,781 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-02 19:56:50,781 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-02 19:56:50,781 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-02 19:56:50,781 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-02 19:56:50,782 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-02 19:56:50,782 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-02 19:56:50,782 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-02 19:56:50,782 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-02 19:56:50,782 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-02 19:56:50,783 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-02 19:56:50,783 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-02 19:56:50,783 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-02 19:56:50,783 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-02 19:56:50,783 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-02 19:56:50,784 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-02 19:56:50,784 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-02 19:56:50,784 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-02 19:56:50,784 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol
[2024-11-02 19:56:51,011 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-02 19:56:51,038 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-02 19:56:51,041 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-02 19:56:51,042 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-02 19:56:51,042 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-02 19:56:51,043 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c
[2024-11-02 19:56:52,472 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-02 19:56:52,640 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-02 19:56:52,641 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c
[2024-11-02 19:56:52,647 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383a73899/b87921baffed4129be831aef4d274083/FLAG08981fe42
[2024-11-02 19:56:52,659 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/383a73899/b87921baffed4129be831aef4d274083
[2024-11-02 19:56:52,661 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-02 19:56:52,662 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-02 19:56:52,664 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-02 19:56:52,664 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-02 19:56:52,669 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-02 19:56:52,669 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,671 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206b198b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52, skipping insertion in model container
[2024-11-02 19:56:52,671 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,689 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-02 19:56:52,846 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400]
[2024-11-02 19:56:52,863 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-02 19:56:52,870 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-02 19:56:52,879 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400]
[2024-11-02 19:56:52,885 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-02 19:56:52,901 INFO  L204         MainTranslator]: Completed translation
[2024-11-02 19:56:52,903 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52 WrapperNode
[2024-11-02 19:56:52,903 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-02 19:56:52,905 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-02 19:56:52,905 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-02 19:56:52,905 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-02 19:56:52,911 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,920 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,938 INFO  L138                Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57
[2024-11-02 19:56:52,939 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-02 19:56:52,939 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-02 19:56:52,939 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-02 19:56:52,940 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-02 19:56:52,949 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,949 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,952 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,966 INFO  L175           MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2].
[2024-11-02 19:56:52,966 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,966 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,976 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,979 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,981 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,981 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,985 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-02 19:56:52,986 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-02 19:56:52,986 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-02 19:56:52,986 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-02 19:56:52,987 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (1/1) ...
[2024-11-02 19:56:52,992 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-02 19:56:53,002 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-02 19:56:53,016 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-02 19:56:53,021 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-02 19:56:53,044 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-02 19:56:53,044 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-02 19:56:53,044 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-02 19:56:53,044 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-02 19:56:53,045 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-02 19:56:53,045 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-02 19:56:53,045 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-02 19:56:53,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-02 19:56:53,045 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2024-11-02 19:56:53,046 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2024-11-02 19:56:53,046 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-02 19:56:53,122 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-02 19:56:53,124 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-02 19:56:53,305 INFO  L?                        ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2024-11-02 19:56:53,305 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-02 19:56:53,319 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-02 19:56:53,319 INFO  L316             CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-02 19:56:53,320 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:53 BoogieIcfgContainer
[2024-11-02 19:56:53,320 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-02 19:56:53,322 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-02 19:56:53,322 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-02 19:56:53,325 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-02 19:56:53,326 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:56:52" (1/3) ...
[2024-11-02 19:56:53,326 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57127d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:53, skipping insertion in model container
[2024-11-02 19:56:53,326 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:56:52" (2/3) ...
[2024-11-02 19:56:53,327 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57127d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:53, skipping insertion in model container
[2024-11-02 19:56:53,327 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:53" (3/3) ...
[2024-11-02 19:56:53,328 INFO  L112   eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c
[2024-11-02 19:56:53,342 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-02 19:56:53,342 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-02 19:56:53,389 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-02 19:56:53,395 INFO  L333      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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7ab2ec20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-02 19:56:53,395 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-02 19:56:53,399 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:53,404 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-02 19:56:53,404 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:53,404 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:53,405 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:53,409 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:53,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times
[2024-11-02 19:56:53,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:53,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [16610804]
[2024-11-02 19:56:53,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:53,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:53,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:53,641 INFO  L255         TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:53,652 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:53,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:53,748 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:53,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:53,796 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:53,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [16610804]
[2024-11-02 19:56:53,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [16610804] provided 2 perfect and 0 imperfect interpolant sequences
[2024-11-02 19:56:53,798 INFO  L185   FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences.
[2024-11-02 19:56:53,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6
[2024-11-02 19:56:53,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468815146]
[2024-11-02 19:56:53,802 INFO  L85    oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton
[2024-11-02 19:56:53,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-02 19:56:53,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:53,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-02 19:56:53,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-02 19:56:53,822 INFO  L87              Difference]: Start difference. First operand  has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:53,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:53,926 INFO  L93              Difference]: Finished difference Result 33 states and 48 transitions.
[2024-11-02 19:56:53,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-02 19:56:53,928 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-02 19:56:53,929 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:53,936 INFO  L225             Difference]: With dead ends: 33
[2024-11-02 19:56:53,936 INFO  L226             Difference]: Without dead ends: 16
[2024-11-02 19:56:53,938 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-02 19:56:53,941 INFO  L432           NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:53,942 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-02 19:56:53,954 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2024-11-02 19:56:53,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13.
[2024-11-02 19:56:53,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:53,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2024-11-02 19:56:53,965 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8
[2024-11-02 19:56:53,965 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:53,966 INFO  L471      AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2024-11-02 19:56:53,966 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:53,966 INFO  L276                IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2024-11-02 19:56:53,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-02 19:56:53,967 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:53,967 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:53,967 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-02 19:56:53,967 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:53,968 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:53,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 1340178133, now seen corresponding path program 1 times
[2024-11-02 19:56:53,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:53,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731650399]
[2024-11-02 19:56:53,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:53,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:54,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:54,121 INFO  L255         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:54,123 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:54,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-02 19:56:54,150 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:54,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-02 19:56:54,181 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:54,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731650399]
[2024-11-02 19:56:54,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [731650399] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:54,181 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:54,181 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2024-11-02 19:56:54,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757864348]
[2024-11-02 19:56:54,182 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:54,186 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-02 19:56:54,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:54,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-02 19:56:54,187 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-02 19:56:54,187 INFO  L87              Difference]: Start difference. First operand 13 states and 14 transitions. Second operand  has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:54,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:54,258 INFO  L93              Difference]: Finished difference Result 27 states and 31 transitions.
[2024-11-02 19:56:54,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-02 19:56:54,260 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2024-11-02 19:56:54,260 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:54,260 INFO  L225             Difference]: With dead ends: 27
[2024-11-02 19:56:54,260 INFO  L226             Difference]: Without dead ends: 19
[2024-11-02 19:56:54,261 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2024-11-02 19:56:54,262 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:54,262 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-02 19:56:54,265 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2024-11-02 19:56:54,268 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2024-11-02 19:56:54,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:54,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions.
[2024-11-02 19:56:54,271 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12
[2024-11-02 19:56:54,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:54,272 INFO  L471      AbstractCegarLoop]: Abstraction has 19 states and 20 transitions.
[2024-11-02 19:56:54,272 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:54,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2024-11-02 19:56:54,273 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-02 19:56:54,273 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:54,274 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:54,274 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-02 19:56:54,274 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:54,275 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:54,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -184165541, now seen corresponding path program 2 times
[2024-11-02 19:56:54,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:54,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510591668]
[2024-11-02 19:56:54,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:54,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:54,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:54,448 INFO  L255         TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:54,453 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:54,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-02 19:56:54,530 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:54,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-02 19:56:54,647 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:54,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510591668]
[2024-11-02 19:56:54,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1510591668] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:54,647 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:54,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12
[2024-11-02 19:56:54,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894326778]
[2024-11-02 19:56:54,648 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:54,651 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-02 19:56:54,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:54,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-02 19:56:54,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2024-11-02 19:56:54,653 INFO  L87              Difference]: Start difference. First operand 19 states and 20 transitions. Second operand  has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:54,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:54,897 INFO  L93              Difference]: Finished difference Result 39 states and 46 transitions.
[2024-11-02 19:56:54,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-02 19:56:54,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2024-11-02 19:56:54,899 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:54,899 INFO  L225             Difference]: With dead ends: 39
[2024-11-02 19:56:54,899 INFO  L226             Difference]: Without dead ends: 31
[2024-11-02 19:56:54,900 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240
[2024-11-02 19:56:54,901 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:54,901 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 28 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-02 19:56:54,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2024-11-02 19:56:54,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2024-11-02 19:56:54,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:54,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2024-11-02 19:56:54,909 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 18
[2024-11-02 19:56:54,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:54,909 INFO  L471      AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2024-11-02 19:56:54,909 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:54,910 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2024-11-02 19:56:54,914 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-02 19:56:54,914 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:54,914 INFO  L215           NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:54,915 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-02 19:56:54,915 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:54,916 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:54,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693974809, now seen corresponding path program 3 times
[2024-11-02 19:56:54,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:54,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545809944]
[2024-11-02 19:56:54,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:54,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:55,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:55,100 INFO  L255         TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:55,106 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:55,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked.
[2024-11-02 19:56:55,370 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:55,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked.
[2024-11-02 19:56:55,660 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:55,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545809944]
[2024-11-02 19:56:55,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [545809944] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:55,661 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:55,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2024-11-02 19:56:55,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093379506]
[2024-11-02 19:56:55,661 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:55,662 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-02 19:56:55,662 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:55,663 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-02 19:56:55,663 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-11-02 19:56:55,664 INFO  L87              Difference]: Start difference. First operand 31 states and 32 transitions. Second operand  has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:56,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:56,223 INFO  L93              Difference]: Finished difference Result 42 states and 46 transitions.
[2024-11-02 19:56:56,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-02 19:56:56,224 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30
[2024-11-02 19:56:56,224 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:56,225 INFO  L225             Difference]: With dead ends: 42
[2024-11-02 19:56:56,225 INFO  L226             Difference]: Without dead ends: 35
[2024-11-02 19:56:56,225 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2024-11-02 19:56:56,226 INFO  L432           NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:56,227 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-02 19:56:56,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2024-11-02 19:56:56,244 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2024-11-02 19:56:56,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:56,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions.
[2024-11-02 19:56:56,245 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30
[2024-11-02 19:56:56,246 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:56,246 INFO  L471      AbstractCegarLoop]: Abstraction has 35 states and 36 transitions.
[2024-11-02 19:56:56,248 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:56,248 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions.
[2024-11-02 19:56:56,249 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2024-11-02 19:56:56,249 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:56,249 INFO  L215           NwaCegarLoop]: trace histogram [10, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:56,249 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-02 19:56:56,249 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:56,250 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:56,250 INFO  L85        PathProgramCache]: Analyzing trace with hash -1219246681, now seen corresponding path program 4 times
[2024-11-02 19:56:56,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:56,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015588079]
[2024-11-02 19:56:56,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:56,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:56,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:56,426 INFO  L255         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:56,428 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:56,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2024-11-02 19:56:56,569 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:56,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2024-11-02 19:56:56,879 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:56,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015588079]
[2024-11-02 19:56:56,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [2015588079] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:56,880 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:56,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24
[2024-11-02 19:56:56,880 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956764894]
[2024-11-02 19:56:56,880 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:56,881 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-11-02 19:56:56,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:56,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-02 19:56:56,882 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552
[2024-11-02 19:56:56,883 INFO  L87              Difference]: Start difference. First operand 35 states and 36 transitions. Second operand  has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:57,220 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:57,220 INFO  L93              Difference]: Finished difference Result 50 states and 52 transitions.
[2024-11-02 19:56:57,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-11-02 19:56:57,222 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34
[2024-11-02 19:56:57,222 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:57,222 INFO  L225             Difference]: With dead ends: 50
[2024-11-02 19:56:57,222 INFO  L226             Difference]: Without dead ends: 38
[2024-11-02 19:56:57,223 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600
[2024-11-02 19:56:57,224 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:57,224 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-02 19:56:57,225 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2024-11-02 19:56:57,234 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37.
[2024-11-02 19:56:57,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:57,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions.
[2024-11-02 19:56:57,236 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34
[2024-11-02 19:56:57,236 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:57,236 INFO  L471      AbstractCegarLoop]: Abstraction has 37 states and 38 transitions.
[2024-11-02 19:56:57,236 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 19:56:57,237 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions.
[2024-11-02 19:56:57,237 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2024-11-02 19:56:57,237 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:57,238 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:57,238 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-02 19:56:57,238 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:57,238 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:57,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139052585, now seen corresponding path program 5 times
[2024-11-02 19:56:57,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:57,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [492974896]
[2024-11-02 19:56:57,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:57,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:57,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:57,503 INFO  L255         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:57,508 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:57:37,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 121 trivial. 0 not checked.
[2024-11-02 19:57:37,208 INFO  L311         TraceCheckSpWp]: Computing backward predicates...