/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/overflow_1-2.c


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


This is Ultimate 0.2.5-dev-b75d321-m
[2024-11-02 19:56:49,964 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-02 19:56:50,022 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,028 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-02 19:56:50,028 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-02 19:56:50,054 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-02 19:56:50,054 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-02 19:56:50,055 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-02 19:56:50,055 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-02 19:56:50,055 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-02 19:56:50,055 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-02 19:56:50,056 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-02 19:56:50,056 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-02 19:56:50,056 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-02 19:56:50,057 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-02 19:56:50,057 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-02 19:56:50,057 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-02 19:56:50,057 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-02 19:56:50,058 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-02 19:56:50,058 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-02 19:56:50,058 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-02 19:56:50,059 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-02 19:56:50,059 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-02 19:56:50,059 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-02 19:56:50,059 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-02 19:56:50,059 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-02 19:56:50,060 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-02 19:56:50,060 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-02 19:56:50,060 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-02 19:56:50,060 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-02 19:56:50,060 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-02 19:56:50,061 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-02 19:56:50,061 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-02 19:56:50,061 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-02 19:56:50,061 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-02 19:56:50,061 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-02 19:56:50,061 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-02 19:56:50,062 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-02 19:56:50,063 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:50,233 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-02 19:56:50,252 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-02 19:56:50,254 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-02 19:56:50,255 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-02 19:56:50,255 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-02 19:56:50,256 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-loops/overflow_1-2.c
[2024-11-02 19:56:51,519 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-02 19:56:51,679 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-02 19:56:51,680 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/overflow_1-2.c
[2024-11-02 19:56:51,685 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcea8a4cd/f5ab7505f7514ee2b375d78b713e5fde/FLAGb29c0fc9d
[2024-11-02 19:56:52,109 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcea8a4cd/f5ab7505f7514ee2b375d78b713e5fde
[2024-11-02 19:56:52,112 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-02 19:56:52,113 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-02 19:56:52,113 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-02 19:56:52,113 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-02 19:56:52,117 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-02 19:56:52,117 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,118 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b3929d 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,118 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,133 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-02 19:56:52,259 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/overflow_1-2.c[324,337]
[2024-11-02 19:56:52,266 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-02 19:56:52,275 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-02 19:56:52,284 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/overflow_1-2.c[324,337]
[2024-11-02 19:56:52,285 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-02 19:56:52,297 INFO  L204         MainTranslator]: Completed translation
[2024-11-02 19:56:52,297 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,298 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-02 19:56:52,298 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-02 19:56:52,298 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-02 19:56:52,299 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-02 19:56:52,304 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,309 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,324 INFO  L138                Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22
[2024-11-02 19:56:52,325 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-02 19:56:52,326 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-02 19:56:52,326 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-02 19:56:52,326 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-02 19:56:52,333 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,333 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,334 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,344 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-02 19:56:52,344 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,344 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,347 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,352 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,353 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,353 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,354 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-02 19:56:52,355 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-02 19:56:52,355 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-02 19:56:52,355 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-02 19:56:52,356 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,360 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-02 19:56:52,370 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-02 19:56:52,386 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:52,389 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:52,412 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-02 19:56:52,412 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-02 19:56:52,412 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-02 19:56:52,413 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-02 19:56:52,473 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-02 19:56:52,475 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-02 19:56:52,568 INFO  L?                        ?]: Removed 6 outVars from TransFormulas that were not future-live.
[2024-11-02 19:56:52,568 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-02 19:56:52,579 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-02 19:56:52,580 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-02 19:56:52,581 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:52 BoogieIcfgContainer
[2024-11-02 19:56:52,581 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-02 19:56:52,583 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-02 19:56:52,583 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-02 19:56:52,586 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-02 19:56:52,587 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:52,587 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec99b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:52, skipping insertion in model container
[2024-11-02 19:56:52,588 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:52,588 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec99b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:56:52, skipping insertion in model container
[2024-11-02 19:56:52,588 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:56:52" (3/3) ...
[2024-11-02 19:56:52,590 INFO  L112   eAbstractionObserver]: Analyzing ICFG overflow_1-2.c
[2024-11-02 19:56:52,604 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-02 19:56:52,605 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-02 19:56:52,654 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-02 19:56:52,659 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;@54057b57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-02 19:56:52,659 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-02 19:56:52,663 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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:52,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-02 19:56:52,667 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:52,667 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:52,668 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:52,671 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:52,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times
[2024-11-02 19:56:52,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:52,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544675081]
[2024-11-02 19:56:52,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:52,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:52,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:52,783 INFO  L255         TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:52,786 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:52,823 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:52,823 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:52,837 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:52,837 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:52,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544675081]
[2024-11-02 19:56:52,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [544675081] provided 2 perfect and 0 imperfect interpolant sequences
[2024-11-02 19:56:52,838 INFO  L185   FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences.
[2024-11-02 19:56:52,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4
[2024-11-02 19:56:52,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125559586]
[2024-11-02 19:56:52,840 INFO  L85    oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton
[2024-11-02 19:56:52,843 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-02 19:56:52,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:52,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-02 19:56:52,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-02 19:56:52,866 INFO  L87              Difference]: Start difference. First operand  has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:52,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:52,924 INFO  L93              Difference]: Finished difference Result 21 states and 27 transitions.
[2024-11-02 19:56:52,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-02 19:56:52,926 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 6
[2024-11-02 19:56:52,926 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:52,930 INFO  L225             Difference]: With dead ends: 21
[2024-11-02 19:56:52,931 INFO  L226             Difference]: Without dead ends: 9
[2024-11-02 19:56:52,932 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-02 19:56:52,935 INFO  L432           NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:52,935 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-02 19:56:52,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-02 19:56:52,954 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-02 19:56:52,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:52,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-02 19:56:52,956 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6
[2024-11-02 19:56:52,956 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:52,956 INFO  L471      AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-02 19:56:52,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:52,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-02 19:56:52,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-02 19:56:52,957 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:52,957 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:52,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-02 19:56:52,957 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:52,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:52,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 1 times
[2024-11-02 19:56:52,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:52,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928979006]
[2024-11-02 19:56:52,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:52,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:53,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:53,023 INFO  L255         TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:53,024 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:53,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:53,073 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:53,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:53,135 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:53,135 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928979006]
[2024-11-02 19:56:53,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [928979006] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:53,135 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:53,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-02 19:56:53,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074897185]
[2024-11-02 19:56:53,136 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:53,140 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-02 19:56:53,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:53,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-02 19:56:53,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-02 19:56:53,141 INFO  L87              Difference]: Start difference. First operand 9 states and 9 transitions. Second operand  has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:53,219 INFO  L93              Difference]: Finished difference Result 17 states and 20 transitions.
[2024-11-02 19:56:53,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-02 19:56:53,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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,220 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:53,220 INFO  L225             Difference]: With dead ends: 17
[2024-11-02 19:56:53,221 INFO  L226             Difference]: Without dead ends: 13
[2024-11-02 19:56:53,221 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2024-11-02 19:56:53,222 INFO  L432           NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:53,222 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-02 19:56:53,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2024-11-02 19:56:53,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2024-11-02 19:56:53,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions.
[2024-11-02 19:56:53,228 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8
[2024-11-02 19:56:53,228 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:53,228 INFO  L471      AbstractCegarLoop]: Abstraction has 13 states and 13 transitions.
[2024-11-02 19:56:53,228 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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,228 INFO  L276                IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2024-11-02 19:56:53,229 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-02 19:56:53,229 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:53,229 INFO  L215           NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:53,232 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-02 19:56:53,232 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:53,232 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:53,232 INFO  L85        PathProgramCache]: Analyzing trace with hash -967103989, now seen corresponding path program 2 times
[2024-11-02 19:56:53,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:53,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084414574]
[2024-11-02 19:56:53,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:53,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:53,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:53,316 INFO  L255         TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:53,323 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:53,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:53,422 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:53,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:53,741 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:53,741 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084414574]
[2024-11-02 19:56:53,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [2084414574] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:53,742 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:53,742 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18
[2024-11-02 19:56:53,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092980137]
[2024-11-02 19:56:53,742 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:53,742 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-11-02 19:56:53,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:53,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-11-02 19:56:53,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306
[2024-11-02 19:56:53,744 INFO  L87              Difference]: Start difference. First operand 13 states and 13 transitions. Second operand  has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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,164 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:54,165 INFO  L93              Difference]: Finished difference Result 27 states and 34 transitions.
[2024-11-02 19:56:54,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-11-02 19:56:54,165 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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,165 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:54,166 INFO  L225             Difference]: With dead ends: 27
[2024-11-02 19:56:54,166 INFO  L226             Difference]: Without dead ends: 21
[2024-11-02 19:56:54,167 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600
[2024-11-02 19:56:54,167 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:54,168 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-02 19:56:54,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2024-11-02 19:56:54,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2024-11-02 19:56:54,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions.
[2024-11-02 19:56:54,176 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12
[2024-11-02 19:56:54,176 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:54,176 INFO  L471      AbstractCegarLoop]: Abstraction has 21 states and 21 transitions.
[2024-11-02 19:56:54,176 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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,176 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions.
[2024-11-02 19:56:54,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-02 19:56:54,177 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:54,177 INFO  L215           NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:54,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-02 19:56:54,177 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:54,178 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:54,179 INFO  L85        PathProgramCache]: Analyzing trace with hash 2078182539, now seen corresponding path program 3 times
[2024-11-02 19:56:54,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:54,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141510778]
[2024-11-02 19:56:54,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:54,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:54,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:54,286 INFO  L255         TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:54,291 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:54,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:54,467 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:55,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:55,198 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:55,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141510778]
[2024-11-02 19:56:55,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [2141510778] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:55,198 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:55,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34
[2024-11-02 19:56:55,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290096624]
[2024-11-02 19:56:55,198 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:55,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-11-02 19:56:55,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:55,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-11-02 19:56:55,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122
[2024-11-02 19:56:55,201 INFO  L87              Difference]: Start difference. First operand 21 states and 21 transitions. Second operand  has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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:56,865 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:56:56,866 INFO  L93              Difference]: Finished difference Result 43 states and 58 transitions.
[2024-11-02 19:56:56,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-11-02 19:56:56,866 INFO  L78                 Accepts]: Start accepts. Automaton has  has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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) Word has length 20
[2024-11-02 19:56:56,866 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:56:56,867 INFO  L225             Difference]: With dead ends: 43
[2024-11-02 19:56:56,867 INFO  L226             Difference]: Without dead ends: 37
[2024-11-02 19:56:56,868 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=800, Invalid=1552, Unknown=0, NotChecked=0, Total=2352
[2024-11-02 19:56:56,868 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-02 19:56:56,869 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-02 19:56:56,869 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2024-11-02 19:56:56,875 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2024-11-02 19:56:56,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions.
[2024-11-02 19:56:56,876 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20
[2024-11-02 19:56:56,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:56:56,876 INFO  L471      AbstractCegarLoop]: Abstraction has 37 states and 37 transitions.
[2024-11-02 19:56:56,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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:56,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions.
[2024-11-02 19:56:56,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2024-11-02 19:56:56,877 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:56:56,877 INFO  L215           NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:56:56,877 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-02 19:56:56,877 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:56:56,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:56:56,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -24784501, now seen corresponding path program 4 times
[2024-11-02 19:56:56,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:56:56,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310066569]
[2024-11-02 19:56:56,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:56:56,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:56:56,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:56:56,987 INFO  L255         TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 38 conjuncts are in the unsatisfiable core
[2024-11-02 19:56:56,990 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:56:57,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:57,439 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:56:59,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:56:59,349 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:56:59,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310066569]
[2024-11-02 19:56:59,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1310066569] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:56:59,349 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:56:59,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 66
[2024-11-02 19:56:59,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944452815]
[2024-11-02 19:56:59,349 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:56:59,350 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 66 states
[2024-11-02 19:56:59,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:56:59,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants.
[2024-11-02 19:56:59,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290
[2024-11-02 19:56:59,352 INFO  L87              Difference]: Start difference. First operand 37 states and 37 transitions. Second operand  has 66 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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:57:07,599 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:57:07,599 INFO  L93              Difference]: Finished difference Result 75 states and 106 transitions.
[2024-11-02 19:57:07,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2024-11-02 19:57:07,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 66 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 36
[2024-11-02 19:57:07,601 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:57:07,601 INFO  L225             Difference]: With dead ends: 75
[2024-11-02 19:57:07,601 INFO  L226             Difference]: Without dead ends: 69
[2024-11-02 19:57:07,604 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=3136, Invalid=6176, Unknown=0, NotChecked=0, Total=9312
[2024-11-02 19:57:07,606 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-02 19:57:07,607 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-02 19:57:07,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2024-11-02 19:57:07,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2024-11-02 19:57:07,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 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:57:07,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions.
[2024-11-02 19:57:07,625 INFO  L78                 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36
[2024-11-02 19:57:07,625 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:57:07,625 INFO  L471      AbstractCegarLoop]: Abstraction has 69 states and 69 transitions.
[2024-11-02 19:57:07,625 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 66 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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:57:07,625 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions.
[2024-11-02 19:57:07,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-11-02 19:57:07,626 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:57:07,626 INFO  L215           NwaCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:57:07,626 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-02 19:57:07,627 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:57:07,627 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:57:07,627 INFO  L85        PathProgramCache]: Analyzing trace with hash 1750489995, now seen corresponding path program 5 times
[2024-11-02 19:57:07,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:57:07,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1331696829]
[2024-11-02 19:57:07,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:57:07,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:57:07,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:57:07,873 INFO  L255         TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjuncts are in the unsatisfiable core
[2024-11-02 19:57:07,878 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:57:09,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:57:09,273 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-02 19:57:15,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:57:15,500 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-02 19:57:15,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1331696829]
[2024-11-02 19:57:15,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1331696829] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-02 19:57:15,500 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-02 19:57:15,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 67] total 130
[2024-11-02 19:57:15,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813506846]
[2024-11-02 19:57:15,500 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-02 19:57:15,501 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 130 states
[2024-11-02 19:57:15,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-02 19:57:15,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants.
[2024-11-02 19:57:15,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770
[2024-11-02 19:57:15,507 INFO  L87              Difference]: Start difference. First operand 69 states and 69 transitions. Second operand  has 130 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 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:58:19,126 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 19:58:19,127 INFO  L93              Difference]: Finished difference Result 139 states and 202 transitions.
[2024-11-02 19:58:19,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. 
[2024-11-02 19:58:19,127 INFO  L78                 Accepts]: Start accepts. Automaton has  has 130 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 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 68
[2024-11-02 19:58:19,128 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 19:58:19,128 INFO  L225             Difference]: With dead ends: 139
[2024-11-02 19:58:19,128 INFO  L226             Difference]: Without dead ends: 133
[2024-11-02 19:58:19,134 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=12416, Invalid=24640, Unknown=0, NotChecked=0, Total=37056
[2024-11-02 19:58:19,134 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 4417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-02 19:58:19,135 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 4417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-02 19:58:19,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2024-11-02 19:58:19,165 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2024-11-02 19:58:19,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.0075757575757576) internal successors, (133), 132 states have internal predecessors, (133), 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:58:19,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions.
[2024-11-02 19:58:19,166 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 68
[2024-11-02 19:58:19,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 19:58:19,166 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 133 transitions.
[2024-11-02 19:58:19,167 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 130 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 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:58:19,167 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions.
[2024-11-02 19:58:19,169 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2024-11-02 19:58:19,169 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 19:58:19,169 INFO  L215           NwaCegarLoop]: trace histogram [126, 1, 1, 1, 1, 1, 1]
[2024-11-02 19:58:19,169 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-02 19:58:19,169 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-02 19:58:19,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 19:58:19,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -33591413, now seen corresponding path program 6 times
[2024-11-02 19:58:19,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-02 19:58:19,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507606018]
[2024-11-02 19:58:19,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 19:58:19,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 19:58:19,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 19:58:19,761 INFO  L255         TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 134 conjuncts are in the unsatisfiable core
[2024-11-02 19:58:19,771 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-02 19:58:24,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-02 19:58:24,744 INFO  L311         TraceCheckSpWp]: Computing backward predicates...