./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:03:42,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:03:42,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:03:42,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:03:42,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:03:42,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:03:42,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:03:42,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:03:42,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:03:42,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:03:42,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:03:42,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:03:42,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:03:42,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:03:42,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:03:42,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:03:42,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:03:42,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:03:42,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:03:42,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:03:42,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:42,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:03:42,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:03:42,247 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2025-03-16 14:03:42,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:03:42,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:03:42,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:03:42,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:03:42,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:03:42,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-16 14:03:43,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70710cf96/571bc71e32b54f87938ab360c2a31277/FLAG7d1608280 [2025-03-16 14:03:43,887 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:03:43,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-16 14:03:43,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70710cf96/571bc71e32b54f87938ab360c2a31277/FLAG7d1608280 [2025-03-16 14:03:43,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70710cf96/571bc71e32b54f87938ab360c2a31277 [2025-03-16 14:03:43,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:03:43,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:03:43,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:43,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:03:43,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:03:43,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:43" (1/1) ... [2025-03-16 14:03:43,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa89389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:43, skipping insertion in model container [2025-03-16 14:03:43,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:43" (1/1) ... [2025-03-16 14:03:43,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:03:44,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-03-16 14:03:44,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:44,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:03:44,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-03-16 14:03:44,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:44,101 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:03:44,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44 WrapperNode [2025-03-16 14:03:44,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:44,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:44,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:03:44,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:03:44,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,128 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-03-16 14:03:44,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:44,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:03:44,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:03:44,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:03:44,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,144 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]. [2025-03-16 14:03:44,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:03:44,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:03:44,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:03:44,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:03:44,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (1/1) ... [2025-03-16 14:03:44,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:44,182 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) [2025-03-16 14:03:44,188 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 [2025-03-16 14:03:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:03:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:03:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-16 14:03:44,203 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-16 14:03:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:03:44,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:03:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-16 14:03:44,205 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-16 14:03:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 14:03:44,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 14:03:44,261 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:03:44,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:03:44,531 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-16 14:03:44,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:03:44,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:03:44,553 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-16 14:03:44,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:44 BoogieIcfgContainer [2025-03-16 14:03:44,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:03:44,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:03:44,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:03:44,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:03:44,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:03:43" (1/3) ... [2025-03-16 14:03:44,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8b600a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:44, skipping insertion in model container [2025-03-16 14:03:44,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:44" (2/3) ... [2025-03-16 14:03:44,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8b600a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:44, skipping insertion in model container [2025-03-16 14:03:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:44" (3/3) ... [2025-03-16 14:03:44,562 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-03-16 14:03:44,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:03:44,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 74 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 14:03:44,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:03:44,611 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;@2be4e82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:03:44,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:03:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 14:03:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 14:03:44,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:44,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:44,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:44,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2020523775, now seen corresponding path program 1 times [2025-03-16 14:03:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089797974] [2025-03-16 14:03:44,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:44,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 14:03:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 14:03:44,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:44,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089797974] [2025-03-16 14:03:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089797974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582340222] [2025-03-16 14:03:45,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:45,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:45,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:45,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:03:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 14:03:45,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 14:03:45,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:45,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:45,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:03:45,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:45,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:45,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582340222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:45,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:03:45,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-03-16 14:03:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092816844] [2025-03-16 14:03:45,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:45,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:03:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:45,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:03:45,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:03:45,258 INFO L87 Difference]: Start difference. First operand has 74 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:45,383 INFO L93 Difference]: Finished difference Result 165 states and 252 transitions. [2025-03-16 14:03:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:03:45,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-16 14:03:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:45,394 INFO L225 Difference]: With dead ends: 165 [2025-03-16 14:03:45,394 INFO L226 Difference]: Without dead ends: 89 [2025-03-16 14:03:45,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:45,399 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 13 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:45,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 619 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-16 14:03:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2025-03-16 14:03:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.378787878787879) internal successors, (91), 68 states have internal predecessors, (91), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-16 14:03:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2025-03-16 14:03:45,432 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 34 [2025-03-16 14:03:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:45,433 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2025-03-16 14:03:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2025-03-16 14:03:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 14:03:45,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:45,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:45,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:03:45,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 14:03:45,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:45,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash -72387352, now seen corresponding path program 1 times [2025-03-16 14:03:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242967844] [2025-03-16 14:03:45,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:45,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 14:03:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 14:03:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:45,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242967844] [2025-03-16 14:03:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242967844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240892914] [2025-03-16 14:03:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:45,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:45,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:45,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:03:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 14:03:45,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 14:03:45,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:45,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:45,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 14:03:45,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:45,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240892914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:46,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-16 14:03:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875849796] [2025-03-16 14:03:46,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:46,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 14:03:46,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:46,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 14:03:46,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-16 14:03:46,069 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 14:03:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:46,214 INFO L93 Difference]: Finished difference Result 153 states and 209 transitions. [2025-03-16 14:03:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:03:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-03-16 14:03:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:46,216 INFO L225 Difference]: With dead ends: 153 [2025-03-16 14:03:46,216 INFO L226 Difference]: Without dead ends: 108 [2025-03-16 14:03:46,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:03:46,217 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:46,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1023 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-16 14:03:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2025-03-16 14:03:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.356164383561644) internal successors, (99), 75 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-16 14:03:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-03-16 14:03:46,227 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 37 [2025-03-16 14:03:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:46,228 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-03-16 14:03:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 14:03:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-03-16 14:03:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:03:46,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:46,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:46,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:03:46,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-16 14:03:46,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:46,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1074636921, now seen corresponding path program 2 times [2025-03-16 14:03:46,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:46,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864819930] [2025-03-16 14:03:46,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:46,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 14:03:46,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 40 statements. [2025-03-16 14:03:46,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 14:03:46,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864819930] [2025-03-16 14:03:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864819930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:46,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:46,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 14:03:46,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263701933] [2025-03-16 14:03:46,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:46,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:03:46,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:46,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:03:46,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:03:46,604 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:46,839 INFO L93 Difference]: Finished difference Result 223 states and 310 transitions. [2025-03-16 14:03:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:03:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-16 14:03:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:46,841 INFO L225 Difference]: With dead ends: 223 [2025-03-16 14:03:46,841 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 14:03:46,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:46,842 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 101 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:46,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1365 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 14:03:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 139. [2025-03-16 14:03:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 115 states have internal predecessors, (150), 17 states have call successors, (17), 7 states have call predecessors, (17), 9 states have return successors, (24), 16 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-16 14:03:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 191 transitions. [2025-03-16 14:03:46,857 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 191 transitions. Word has length 40 [2025-03-16 14:03:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:46,857 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 191 transitions. [2025-03-16 14:03:46,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 191 transitions. [2025-03-16 14:03:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:03:46,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:46,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:03:46,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1271150426, now seen corresponding path program 1 times [2025-03-16 14:03:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585189545] [2025-03-16 14:03:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:03:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:03:46,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:46,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585189545] [2025-03-16 14:03:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585189545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 14:03:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814221544] [2025-03-16 14:03:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:03:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:47,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:03:47,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:47,240 INFO L87 Difference]: Start difference. First operand 139 states and 191 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:47,471 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2025-03-16 14:03:47,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:03:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-16 14:03:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:47,472 INFO L225 Difference]: With dead ends: 161 [2025-03-16 14:03:47,473 INFO L226 Difference]: Without dead ends: 159 [2025-03-16 14:03:47,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-16 14:03:47,473 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 68 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:47,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1493 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-16 14:03:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-03-16 14:03:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 122 states have (on average 1.319672131147541) internal successors, (161), 126 states have internal predecessors, (161), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-16 14:03:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 204 transitions. [2025-03-16 14:03:47,483 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 204 transitions. Word has length 40 [2025-03-16 14:03:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:47,483 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 204 transitions. [2025-03-16 14:03:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2025-03-16 14:03:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 14:03:47,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:47,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:47,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:03:47,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:47,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash -179700101, now seen corresponding path program 1 times [2025-03-16 14:03:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797085646] [2025-03-16 14:03:47,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:47,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:03:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:03:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:47,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797085646] [2025-03-16 14:03:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797085646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:47,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:47,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 14:03:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718340238] [2025-03-16 14:03:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:47,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 14:03:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:47,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 14:03:47,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:03:47,599 INFO L87 Difference]: Start difference. First operand 151 states and 204 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 14:03:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:47,695 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2025-03-16 14:03:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 14:03:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-16 14:03:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:47,700 INFO L225 Difference]: With dead ends: 234 [2025-03-16 14:03:47,700 INFO L226 Difference]: Without dead ends: 194 [2025-03-16 14:03:47,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:03:47,701 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:47,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 709 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-16 14:03:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2025-03-16 14:03:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 156 states have internal predecessors, (203), 22 states have call successors, (22), 9 states have call predecessors, (22), 11 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2025-03-16 14:03:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 254 transitions. [2025-03-16 14:03:47,720 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 254 transitions. Word has length 42 [2025-03-16 14:03:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 254 transitions. [2025-03-16 14:03:47,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 14:03:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 254 transitions. [2025-03-16 14:03:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 14:03:47,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:47,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:47,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:03:47,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash -376213606, now seen corresponding path program 1 times [2025-03-16 14:03:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413346825] [2025-03-16 14:03:47,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:47,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:03:47,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:03:47,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:47,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413346825] [2025-03-16 14:03:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413346825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700190395] [2025-03-16 14:03:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:47,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:47,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:03:47,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:03:47,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:03:47,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:47,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:47,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 14:03:47,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:47,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700190395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:48,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:48,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-16 14:03:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499172612] [2025-03-16 14:03:48,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:48,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 14:03:48,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:48,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 14:03:48,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:03:48,023 INFO L87 Difference]: Start difference. First operand 186 states and 254 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 14:03:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:48,119 INFO L93 Difference]: Finished difference Result 280 states and 383 transitions. [2025-03-16 14:03:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:03:48,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2025-03-16 14:03:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:48,120 INFO L225 Difference]: With dead ends: 280 [2025-03-16 14:03:48,121 INFO L226 Difference]: Without dead ends: 209 [2025-03-16 14:03:48,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-16 14:03:48,122 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 11 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:48,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 892 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-16 14:03:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2025-03-16 14:03:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 159 states have (on average 1.320754716981132) internal successors, (210), 163 states have internal predecessors, (210), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (31), 22 states have call predecessors, (31), 23 states have call successors, (31) [2025-03-16 14:03:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2025-03-16 14:03:48,139 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 42 [2025-03-16 14:03:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:48,140 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2025-03-16 14:03:48,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 14:03:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2025-03-16 14:03:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 14:03:48,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:48,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:48,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:48,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:48,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:48,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash 189443792, now seen corresponding path program 1 times [2025-03-16 14:03:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:48,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718178124] [2025-03-16 14:03:48,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:48,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 14:03:48,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 14:03:48,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:48,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:03:48,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:48,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718178124] [2025-03-16 14:03:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718178124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:48,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:48,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 14:03:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314486864] [2025-03-16 14:03:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:48,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 14:03:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:48,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 14:03:48,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-16 14:03:48,562 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 14:03:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:48,783 INFO L93 Difference]: Finished difference Result 282 states and 381 transitions. [2025-03-16 14:03:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 14:03:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2025-03-16 14:03:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:48,785 INFO L225 Difference]: With dead ends: 282 [2025-03-16 14:03:48,785 INFO L226 Difference]: Without dead ends: 274 [2025-03-16 14:03:48,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:03:48,786 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 56 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:48,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 993 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-16 14:03:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 201. [2025-03-16 14:03:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 163 states have (on average 1.312883435582822) internal successors, (214), 166 states have internal predecessors, (214), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-16 14:03:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2025-03-16 14:03:48,806 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 43 [2025-03-16 14:03:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:48,806 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2025-03-16 14:03:48,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 14:03:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2025-03-16 14:03:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 14:03:48,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:48,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:03:48,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1063035804, now seen corresponding path program 1 times [2025-03-16 14:03:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339272228] [2025-03-16 14:03:48,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:48,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:03:48,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:03:48,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:48,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339272228] [2025-03-16 14:03:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339272228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326234772] [2025-03-16 14:03:48,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:48,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:48,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:03:48,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:03:48,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:03:48,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:48,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:48,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 14:03:48,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:49,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:49,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326234772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:49,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:03:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2025-03-16 14:03:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829182688] [2025-03-16 14:03:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:49,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:03:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:49,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:03:49,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:03:49,016 INFO L87 Difference]: Start difference. First operand 201 states and 271 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:03:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:49,121 INFO L93 Difference]: Finished difference Result 364 states and 504 transitions. [2025-03-16 14:03:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:03:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-03-16 14:03:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:49,122 INFO L225 Difference]: With dead ends: 364 [2025-03-16 14:03:49,122 INFO L226 Difference]: Without dead ends: 289 [2025-03-16 14:03:49,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:49,123 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 59 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:49,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 838 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-16 14:03:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2025-03-16 14:03:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.3198198198198199) internal successors, (293), 225 states have internal predecessors, (293), 34 states have call successors, (34), 12 states have call predecessors, (34), 14 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2025-03-16 14:03:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 370 transitions. [2025-03-16 14:03:49,142 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 370 transitions. Word has length 42 [2025-03-16 14:03:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:49,142 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 370 transitions. [2025-03-16 14:03:49,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:03:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 370 transitions. [2025-03-16 14:03:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 14:03:49,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:49,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:49,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:03:49,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:49,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1509868772, now seen corresponding path program 1 times [2025-03-16 14:03:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352274830] [2025-03-16 14:03:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:49,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 14:03:49,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 14:03:49,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:49,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352274830] [2025-03-16 14:03:49,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352274830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579207220] [2025-03-16 14:03:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:49,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:49,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:49,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:49,369 INFO L87 Difference]: Start difference. First operand 271 states and 370 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:49,419 INFO L93 Difference]: Finished difference Result 546 states and 753 transitions. [2025-03-16 14:03:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-16 14:03:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:49,420 INFO L225 Difference]: With dead ends: 546 [2025-03-16 14:03:49,420 INFO L226 Difference]: Without dead ends: 277 [2025-03-16 14:03:49,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:49,421 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:49,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 163 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-16 14:03:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2025-03-16 14:03:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 224 states have (on average 1.3214285714285714) internal successors, (296), 227 states have internal predecessors, (296), 34 states have call successors, (34), 12 states have call predecessors, (34), 14 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2025-03-16 14:03:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2025-03-16 14:03:49,435 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 43 [2025-03-16 14:03:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:49,435 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2025-03-16 14:03:49,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2025-03-16 14:03:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 14:03:49,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:49,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:49,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:03:49,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:49,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1412630094, now seen corresponding path program 1 times [2025-03-16 14:03:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-03-16 14:03:49,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 14:03:49,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 14:03:49,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:49,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 14:03:49,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:49,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-03-16 14:03:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852433967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:49,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:03:49,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753312180] [2025-03-16 14:03:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:49,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:03:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:49,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:03:49,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:49,490 INFO L87 Difference]: Start difference. First operand 273 states and 373 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-16 14:03:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:49,531 INFO L93 Difference]: Finished difference Result 281 states and 380 transitions. [2025-03-16 14:03:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:03:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2025-03-16 14:03:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:49,533 INFO L225 Difference]: With dead ends: 281 [2025-03-16 14:03:49,533 INFO L226 Difference]: Without dead ends: 266 [2025-03-16 14:03:49,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:03:49,533 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:49,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 441 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-16 14:03:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-16 14:03:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 223 states have internal predecessors, (290), 32 states have call successors, (32), 12 states have call predecessors, (32), 14 states have return successors, (40), 30 states have call predecessors, (40), 31 states have call successors, (40) [2025-03-16 14:03:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2025-03-16 14:03:49,546 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 45 [2025-03-16 14:03:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2025-03-16 14:03:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-16 14:03:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2025-03-16 14:03:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 14:03:49,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:49,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:49,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:03:49,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:49,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash 891312219, now seen corresponding path program 1 times [2025-03-16 14:03:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-03-16 14:03:49,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:49,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 14:03:49,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 14:03:49,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:49,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:03:49,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-03-16 14:03:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060637101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:49,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 14:03:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131326022] [2025-03-16 14:03:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:49,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 14:03:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:49,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 14:03:49,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:03:49,650 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 14:03:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:49,734 INFO L93 Difference]: Finished difference Result 285 states and 382 transitions. [2025-03-16 14:03:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 14:03:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-03-16 14:03:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:49,736 INFO L225 Difference]: With dead ends: 285 [2025-03-16 14:03:49,736 INFO L226 Difference]: Without dead ends: 245 [2025-03-16 14:03:49,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:03:49,737 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 11 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:49,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 800 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-16 14:03:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 239. [2025-03-16 14:03:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 195 states have (on average 1.3076923076923077) internal successors, (255), 199 states have internal predecessors, (255), 29 states have call successors, (29), 12 states have call predecessors, (29), 14 states have return successors, (37), 27 states have call predecessors, (37), 28 states have call successors, (37) [2025-03-16 14:03:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2025-03-16 14:03:49,750 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 45 [2025-03-16 14:03:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2025-03-16 14:03:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 14:03:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2025-03-16 14:03:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 14:03:49,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:49,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:03:49,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 688924439, now seen corresponding path program 1 times [2025-03-16 14:03:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721427649] [2025-03-16 14:03:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:49,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 14:03:49,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 14:03:49,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:03:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721427649] [2025-03-16 14:03:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721427649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:49,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:49,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:49,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681587702] [2025-03-16 14:03:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:49,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:49,783 INFO L87 Difference]: Start difference. First operand 239 states and 321 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:49,818 INFO L93 Difference]: Finished difference Result 482 states and 652 transitions. [2025-03-16 14:03:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-16 14:03:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:49,819 INFO L225 Difference]: With dead ends: 482 [2025-03-16 14:03:49,819 INFO L226 Difference]: Without dead ends: 245 [2025-03-16 14:03:49,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:49,820 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:49,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-16 14:03:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2025-03-16 14:03:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 197 states have (on average 1.3045685279187818) internal successors, (257), 201 states have internal predecessors, (257), 29 states have call successors, (29), 12 states have call predecessors, (29), 14 states have return successors, (37), 27 states have call predecessors, (37), 28 states have call successors, (37) [2025-03-16 14:03:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 323 transitions. [2025-03-16 14:03:49,832 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 323 transitions. Word has length 44 [2025-03-16 14:03:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 323 transitions. [2025-03-16 14:03:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 323 transitions. [2025-03-16 14:03:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 14:03:49,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:49,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:49,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:03:49,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:49,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1506595514, now seen corresponding path program 1 times [2025-03-16 14:03:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:49,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979419690] [2025-03-16 14:03:49,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:49,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:03:49,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:03:49,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:49,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:03:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979419690] [2025-03-16 14:03:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979419690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527181729] [2025-03-16 14:03:49,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:49,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:49,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:49,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:03:49,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:03:49,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:03:49,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:49,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:49,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 14:03:49,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:50,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:03:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527181729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:50,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2025-03-16 14:03:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243730855] [2025-03-16 14:03:50,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 14:03:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:50,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 14:03:50,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-03-16 14:03:50,470 INFO L87 Difference]: Start difference. First operand 241 states and 323 transitions. Second operand has 32 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-16 14:03:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:51,831 INFO L93 Difference]: Finished difference Result 454 states and 642 transitions. [2025-03-16 14:03:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 14:03:51,832 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 46 [2025-03-16 14:03:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:51,837 INFO L225 Difference]: With dead ends: 454 [2025-03-16 14:03:51,837 INFO L226 Difference]: Without dead ends: 429 [2025-03-16 14:03:51,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2025-03-16 14:03:51,839 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 279 mSDsluCounter, 2915 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:51,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 3091 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:03:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-16 14:03:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 284. [2025-03-16 14:03:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 229 states have (on average 1.2925764192139737) internal successors, (296), 237 states have internal predecessors, (296), 35 states have call successors, (35), 11 states have call predecessors, (35), 19 states have return successors, (55), 35 states have call predecessors, (55), 34 states have call successors, (55) [2025-03-16 14:03:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 386 transitions. [2025-03-16 14:03:51,861 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 386 transitions. Word has length 46 [2025-03-16 14:03:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:51,861 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 386 transitions. [2025-03-16 14:03:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-16 14:03:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 386 transitions. [2025-03-16 14:03:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 14:03:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:51,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:51,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 14:03:52,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1669977234, now seen corresponding path program 2 times [2025-03-16 14:03:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:52,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230501437] [2025-03-16 14:03:52,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:52,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-16 14:03:52,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:03:52,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:52,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230501437] [2025-03-16 14:03:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230501437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693947717] [2025-03-16 14:03:52,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:52,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:52,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:52,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:03:52,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-16 14:03:52,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:03:52,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:52,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:52,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 14:03:52,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:52,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:03:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693947717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:52,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2025-03-16 14:03:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315886673] [2025-03-16 14:03:52,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:52,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 14:03:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:52,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 14:03:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-16 14:03:52,747 INFO L87 Difference]: Start difference. First operand 284 states and 386 transitions. Second operand has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 14:03:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:53,852 INFO L93 Difference]: Finished difference Result 452 states and 647 transitions. [2025-03-16 14:03:53,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 14:03:53,852 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 46 [2025-03-16 14:03:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:53,854 INFO L225 Difference]: With dead ends: 452 [2025-03-16 14:03:53,854 INFO L226 Difference]: Without dead ends: 439 [2025-03-16 14:03:53,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=2705, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 14:03:53,856 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 223 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:53,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 3335 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:03:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-16 14:03:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 297. [2025-03-16 14:03:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 245 states have internal predecessors, (304), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-03-16 14:03:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 412 transitions. [2025-03-16 14:03:53,872 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 412 transitions. Word has length 46 [2025-03-16 14:03:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:53,872 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 412 transitions. [2025-03-16 14:03:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 14:03:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 412 transitions. [2025-03-16 14:03:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 14:03:53,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:53,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:53,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:03:54,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:54,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:54,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash -149486928, now seen corresponding path program 1 times [2025-03-16 14:03:54,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:54,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449970043] [2025-03-16 14:03:54,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:54,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 14:03:54,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 14:03:54,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:54,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449970043] [2025-03-16 14:03:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449970043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:03:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224681297] [2025-03-16 14:03:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:03:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:54,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:03:54,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:03:54,114 INFO L87 Difference]: Start difference. First operand 297 states and 412 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:54,163 INFO L93 Difference]: Finished difference Result 600 states and 839 transitions. [2025-03-16 14:03:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:03:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-16 14:03:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:54,165 INFO L225 Difference]: With dead ends: 600 [2025-03-16 14:03:54,165 INFO L226 Difference]: Without dead ends: 305 [2025-03-16 14:03:54,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:03:54,167 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 8 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:54,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-16 14:03:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 295. [2025-03-16 14:03:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 243 states have internal predecessors, (301), 39 states have call successors, (39), 12 states have call predecessors, (39), 20 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-03-16 14:03:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 409 transitions. [2025-03-16 14:03:54,183 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 409 transitions. Word has length 45 [2025-03-16 14:03:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:54,183 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 409 transitions. [2025-03-16 14:03:54,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:03:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2025-03-16 14:03:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 14:03:54,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:54,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:03:54,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1190872152, now seen corresponding path program 1 times [2025-03-16 14:03:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157393968] [2025-03-16 14:03:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:54,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:03:54,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:03:54,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:54,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157393968] [2025-03-16 14:03:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157393968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593803252] [2025-03-16 14:03:54,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:54,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:54,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:54,304 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:54,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:03:54,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 14:03:54,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 14:03:54,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:54,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:54,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 14:03:54,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:54,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:04:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:04:51,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593803252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:04:51,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:04:51,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 32 [2025-03-16 14:04:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165967338] [2025-03-16 14:04:51,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:04:51,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 14:04:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:04:51,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 14:04:51,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=900, Unknown=10, NotChecked=0, Total=992 [2025-03-16 14:04:51,125 INFO L87 Difference]: Start difference. First operand 295 states and 409 transitions. Second operand has 32 states, 28 states have (on average 2.142857142857143) internal successors, (60), 24 states have internal predecessors, (60), 9 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 14:04:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:04:53,005 INFO L93 Difference]: Finished difference Result 584 states and 800 transitions. [2025-03-16 14:04:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 14:04:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.142857142857143) internal successors, (60), 24 states have internal predecessors, (60), 9 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2025-03-16 14:04:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:04:53,008 INFO L225 Difference]: With dead ends: 584 [2025-03-16 14:04:53,008 INFO L226 Difference]: Without dead ends: 439 [2025-03-16 14:04:53,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=206, Invalid=1946, Unknown=10, NotChecked=0, Total=2162 [2025-03-16 14:04:53,010 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 292 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:04:53,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 2446 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:04:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-16 14:04:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 392. [2025-03-16 14:04:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 327 states have internal predecessors, (405), 48 states have call successors, (48), 16 states have call predecessors, (48), 27 states have return successors, (76), 48 states have call predecessors, (76), 47 states have call successors, (76) [2025-03-16 14:04:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2025-03-16 14:04:53,038 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 46 [2025-03-16 14:04:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:04:53,038 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2025-03-16 14:04:53,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.142857142857143) internal successors, (60), 24 states have internal predecessors, (60), 9 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 14:04:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2025-03-16 14:04:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 14:04:53,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:04:53,040 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:04:53,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 14:04:53,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:04:53,244 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:04:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:04:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1931873102, now seen corresponding path program 1 times [2025-03-16 14:04:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:04:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008967621] [2025-03-16 14:04:53,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:04:53,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 14:04:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 14:04:53,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:53,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:04:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:04:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:04:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008967621] [2025-03-16 14:04:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008967621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:04:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400143164] [2025-03-16 14:04:53,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:04:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:04:53,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:04:53,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:04:53,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 14:04:53,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 14:04:53,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:53,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:04:53,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 14:04:53,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:04:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:04:53,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:04:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:04:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400143164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:04:53,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:04:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2025-03-16 14:04:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841439307] [2025-03-16 14:04:53,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:04:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 14:04:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:04:53,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 14:04:53,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-16 14:04:53,663 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 23 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 14:04:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:04:54,041 INFO L93 Difference]: Finished difference Result 512 states and 708 transitions. [2025-03-16 14:04:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 14:04:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 48 [2025-03-16 14:04:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:04:54,045 INFO L225 Difference]: With dead ends: 512 [2025-03-16 14:04:54,045 INFO L226 Difference]: Without dead ends: 473 [2025-03-16 14:04:54,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-03-16 14:04:54,045 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 217 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:04:54,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1346 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:04:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-16 14:04:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 394. [2025-03-16 14:04:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 316 states have (on average 1.2721518987341771) internal successors, (402), 329 states have internal predecessors, (402), 49 states have call successors, (49), 15 states have call predecessors, (49), 28 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-03-16 14:04:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 538 transitions. [2025-03-16 14:04:54,070 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 538 transitions. Word has length 48 [2025-03-16 14:04:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:04:54,070 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 538 transitions. [2025-03-16 14:04:54,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 14:04:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 538 transitions. [2025-03-16 14:04:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 14:04:54,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:04:54,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:04:54,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 14:04:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 14:04:54,275 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:04:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:04:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1511579822, now seen corresponding path program 1 times [2025-03-16 14:04:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:04:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413895283] [2025-03-16 14:04:54,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:04:54,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:04:54,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:04:54,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:54,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:04:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:04:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:04:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413895283] [2025-03-16 14:04:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413895283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:04:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:04:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:04:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348515144] [2025-03-16 14:04:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:04:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:04:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:04:54,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:04:54,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:04:54,344 INFO L87 Difference]: Start difference. First operand 394 states and 538 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:04:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:04:54,408 INFO L93 Difference]: Finished difference Result 792 states and 1086 transitions. [2025-03-16 14:04:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:04:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-16 14:04:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:04:54,412 INFO L225 Difference]: With dead ends: 792 [2025-03-16 14:04:54,413 INFO L226 Difference]: Without dead ends: 400 [2025-03-16 14:04:54,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:04:54,414 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:04:54,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 256 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:04:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-16 14:04:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 392. [2025-03-16 14:04:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 314 states have (on average 1.267515923566879) internal successors, (398), 327 states have internal predecessors, (398), 49 states have call successors, (49), 15 states have call predecessors, (49), 28 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-03-16 14:04:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 534 transitions. [2025-03-16 14:04:54,437 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 534 transitions. Word has length 47 [2025-03-16 14:04:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:04:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 534 transitions. [2025-03-16 14:04:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:04:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 534 transitions. [2025-03-16 14:04:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 14:04:54,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:04:54,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:04:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:04:54,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:04:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:04:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1803254583, now seen corresponding path program 1 times [2025-03-16 14:04:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:04:54,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239620571] [2025-03-16 14:04:54,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:04:54,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:04:54,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:04:54,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:54,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:04:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 14:04:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:04:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239620571] [2025-03-16 14:04:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239620571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:04:54,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:04:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 14:04:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66795787] [2025-03-16 14:04:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:04:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:04:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:04:54,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:04:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:04:54,589 INFO L87 Difference]: Start difference. First operand 392 states and 534 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:04:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:04:54,675 INFO L93 Difference]: Finished difference Result 402 states and 542 transitions. [2025-03-16 14:04:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:04:54,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-16 14:04:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:04:54,677 INFO L225 Difference]: With dead ends: 402 [2025-03-16 14:04:54,677 INFO L226 Difference]: Without dead ends: 400 [2025-03-16 14:04:54,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:04:54,678 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 12 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:04:54,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 464 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:04:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-16 14:04:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-16 14:04:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 320 states have (on average 1.2625) internal successors, (404), 333 states have internal predecessors, (404), 49 states have call successors, (49), 17 states have call predecessors, (49), 30 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-03-16 14:04:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 540 transitions. [2025-03-16 14:04:54,702 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 540 transitions. Word has length 47 [2025-03-16 14:04:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:04:54,703 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 540 transitions. [2025-03-16 14:04:54,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:04:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 540 transitions. [2025-03-16 14:04:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 14:04:54,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:04:54,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:04:54,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:04:54,706 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:04:54,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:04:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 241292637, now seen corresponding path program 1 times [2025-03-16 14:04:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:04:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209371357] [2025-03-16 14:04:54,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:04:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 14:04:54,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:04:54,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:54,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:04:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:04:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:04:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209371357] [2025-03-16 14:04:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209371357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:04:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249761445] [2025-03-16 14:04:54,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:54,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:04:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:04:54,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:04:54,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 14:04:54,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 14:04:54,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:04:54,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:04:54,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 14:04:54,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:04:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:04:54,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:04:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 14:04:55,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249761445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:04:55,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:04:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-16 14:04:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714386706] [2025-03-16 14:04:55,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:04:55,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 14:04:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:04:55,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 14:04:55,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-03-16 14:04:55,195 INFO L87 Difference]: Start difference. First operand 400 states and 540 transitions. Second operand has 25 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 14:04:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:04:55,738 INFO L93 Difference]: Finished difference Result 489 states and 680 transitions. [2025-03-16 14:04:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 14:04:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2025-03-16 14:04:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:04:55,740 INFO L225 Difference]: With dead ends: 489 [2025-03-16 14:04:55,740 INFO L226 Difference]: Without dead ends: 457 [2025-03-16 14:04:55,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 14:04:55,741 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 171 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:04:55,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1735 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:04:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-16 14:04:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 386. [2025-03-16 14:04:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 310 states have (on average 1.270967741935484) internal successors, (394), 322 states have internal predecessors, (394), 47 states have call successors, (47), 15 states have call predecessors, (47), 28 states have return successors, (83), 48 states have call predecessors, (83), 46 states have call successors, (83) [2025-03-16 14:04:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2025-03-16 14:04:55,763 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 53 [2025-03-16 14:04:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:04:55,763 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2025-03-16 14:04:55,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 14:04:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2025-03-16 14:04:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 14:04:55,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:04:55,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:04:55,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 14:04:55,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:04:55,966 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:04:55,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:04:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1840606837, now seen corresponding path program 1 times [2025-03-16 14:04:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:04:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5767555] [2025-03-16 14:04:55,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:04:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:04:55,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 14:04:55,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:04:55,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:04:55,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 14:04:55,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 14:04:56,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:04:56,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:04:56,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:04:56,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 14:04:56,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 14:04:56,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:04:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:04:56,033 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:04:56,062 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:04:56,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:04:56 BoogieIcfgContainer [2025-03-16 14:04:56,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:04:56,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:04:56,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:04:56,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:04:56,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:44" (3/4) ... [2025-03-16 14:04:56,067 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 14:04:56,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:04:56,068 INFO L158 Benchmark]: Toolchain (without parser) took 72154.02ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 112.6MB in the beginning and 88.2MB in the end (delta: 24.5MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2025-03-16 14:04:56,068 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:04:56,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.13ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 99.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:04:56,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.52ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:04:56,069 INFO L158 Benchmark]: Boogie Preprocessor took 26.29ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.6MB in the end (delta: 968.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:04:56,070 INFO L158 Benchmark]: IcfgBuilder took 398.47ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 75.1MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:04:56,072 INFO L158 Benchmark]: TraceAbstraction took 71508.82ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 74.6MB in the beginning and 88.2MB in the end (delta: -13.6MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2025-03-16 14:04:56,072 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 268.4MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:04:56,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.13ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 99.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.52ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.29ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.6MB in the end (delta: 968.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 398.47ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 75.1MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 71508.82ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 74.6MB in the beginning and 88.2MB in the end (delta: -13.6MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 268.4MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=127, eb=-127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=-127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=-127, ma=33554432] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=4311744512, \result=16777216] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=-127, ma=33554432, mb=4311744512] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777216] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, ea=127, eb=-127, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, delta=254, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 117 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.4s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1774 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1651 mSDsluCounter, 22435 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20226 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7453 IncrementalHoareTripleChecker+Invalid, 7720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 2209 mSDtfsCounter, 7453 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 657 SyntacticMatches, 1 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 60.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=19, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 694 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 61.2s InterpolantComputationTime, 1322 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1551 ConstructedInterpolants, 10 QuantifiedInterpolants, 4169 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1317 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 36 InterpolantComputations, 13 PerfectInterpolantSequences, 582/678 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 14:04:56,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:04:57,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:04:57,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 14:04:57,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:04:57,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:04:57,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:04:57,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:04:57,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:04:57,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:04:57,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:04:57,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:04:57,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:04:57,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:04:57,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:04:57,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:04:57,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:04:57,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:04:57,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:04:57,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 14:04:57,884 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 14:04:57,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:04:57,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:04:57,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:04:57,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:04:57,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2025-03-16 14:04:58,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:04:58,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:04:58,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:04:58,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:04:58,097 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:04:58,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-16 14:04:59,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04bc7315/e275ba85a19f4c16aaba2181fd8c670a/FLAG3a81eea00 [2025-03-16 14:04:59,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:04:59,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-16 14:04:59,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04bc7315/e275ba85a19f4c16aaba2181fd8c670a/FLAG3a81eea00 [2025-03-16 14:04:59,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d04bc7315/e275ba85a19f4c16aaba2181fd8c670a [2025-03-16 14:04:59,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:04:59,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:04:59,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:04:59,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:04:59,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:04:59,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3435c31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59, skipping insertion in model container [2025-03-16 14:04:59,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:04:59,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-03-16 14:04:59,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:04:59,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:04:59,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-03-16 14:04:59,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:04:59,697 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:04:59,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59 WrapperNode [2025-03-16 14:04:59,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:04:59,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:04:59,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:04:59,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:04:59,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,725 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-03-16 14:04:59,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:04:59,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:04:59,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:04:59,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:04:59,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,749 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]. [2025-03-16 14:04:59,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:04:59,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:04:59,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:04:59,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:04:59,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (1/1) ... [2025-03-16 14:04:59,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:04:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:04:59,784 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) [2025-03-16 14:04:59,787 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 [2025-03-16 14:04:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:04:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 14:04:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-16 14:04:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-16 14:04:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:04:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:04:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-16 14:04:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-16 14:04:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 14:04:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 14:04:59,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:04:59,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:05:00,075 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-16 14:05:00,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:05:00,085 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:05:00,085 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:05:00,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:05:00 BoogieIcfgContainer [2025-03-16 14:05:00,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:05:00,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:05:00,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:05:00,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:05:00,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:04:59" (1/3) ... [2025-03-16 14:05:00,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab389b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:05:00, skipping insertion in model container [2025-03-16 14:05:00,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:04:59" (2/3) ... [2025-03-16 14:05:00,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab389b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:05:00, skipping insertion in model container [2025-03-16 14:05:00,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:05:00" (3/3) ... [2025-03-16 14:05:00,094 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-03-16 14:05:00,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:05:00,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 50 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 14:05:00,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:05:00,143 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;@7a72b9ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:05:00,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:05:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 14:05:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 14:05:00,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:00,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:00,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:00,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1587518356, now seen corresponding path program 1 times [2025-03-16 14:05:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709971573] [2025-03-16 14:05:00,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:00,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:05:00,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 14:05:00,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 14:05:00,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:00,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:05:00,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:05:00,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:05:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:05:00,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709971573] [2025-03-16 14:05:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709971573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:05:00,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:05:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-16 14:05:00,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087055997] [2025-03-16 14:05:00,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:05:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 14:05:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:00,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 14:05:00,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:05:00,478 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:05:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:00,617 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2025-03-16 14:05:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:05:00,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-16 14:05:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:00,628 INFO L225 Difference]: With dead ends: 120 [2025-03-16 14:05:00,628 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 14:05:00,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:05:00,634 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:00,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 478 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:05:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 14:05:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2025-03-16 14:05:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 45 states have internal predecessors, (58), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-16 14:05:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2025-03-16 14:05:00,659 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 30 [2025-03-16 14:05:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:00,660 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2025-03-16 14:05:00,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:05:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2025-03-16 14:05:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 14:05:00,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:00,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:00,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:05:00,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:00,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:00,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash 621987204, now seen corresponding path program 1 times [2025-03-16 14:05:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:00,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487753087] [2025-03-16 14:05:00,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:00,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:00,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:00,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:00,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:05:00,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 14:05:00,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 14:05:00,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:00,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:00,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:05:00,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:05:01,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:05:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:05:01,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:01,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487753087] [2025-03-16 14:05:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487753087] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:05:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:05:01,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-03-16 14:05:01,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605349532] [2025-03-16 14:05:01,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:01,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:05:01,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:01,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:05:01,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-16 14:05:01,180 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:01,283 INFO L93 Difference]: Finished difference Result 124 states and 169 transitions. [2025-03-16 14:05:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 14:05:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-16 14:05:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:01,285 INFO L225 Difference]: With dead ends: 124 [2025-03-16 14:05:01,285 INFO L226 Difference]: Without dead ends: 92 [2025-03-16 14:05:01,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:05:01,286 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:01,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 486 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:05:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-16 14:05:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2025-03-16 14:05:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 63 states have internal predecessors, (80), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2025-03-16 14:05:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2025-03-16 14:05:01,298 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 33 [2025-03-16 14:05:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:01,298 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2025-03-16 14:05:01,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2025-03-16 14:05:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 14:05:01,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:01,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:01,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:05:01,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:01,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 650616355, now seen corresponding path program 1 times [2025-03-16 14:05:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261486611] [2025-03-16 14:05:01,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:01,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:01,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:05:01,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 14:05:01,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 14:05:01,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:01,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:01,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:05:01,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:05:01,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:05:01,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261486611] [2025-03-16 14:05:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261486611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 14:05:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793342328] [2025-03-16 14:05:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:05:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:01,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:05:01,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:05:01,592 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:01,676 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2025-03-16 14:05:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:05:01,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-16 14:05:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:01,680 INFO L225 Difference]: With dead ends: 123 [2025-03-16 14:05:01,680 INFO L226 Difference]: Without dead ends: 83 [2025-03-16 14:05:01,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:05:01,681 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:01,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 405 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-16 14:05:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2025-03-16 14:05:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 51 states have internal predecessors, (64), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-16 14:05:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2025-03-16 14:05:01,690 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 33 [2025-03-16 14:05:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:01,690 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2025-03-16 14:05:01,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2025-03-16 14:05:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:05:01,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:01,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:01,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:05:01,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:01,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:01,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1685401154, now seen corresponding path program 2 times [2025-03-16 14:05:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325779747] [2025-03-16 14:05:01,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:05:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:01,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:01,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:05:01,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-16 14:05:01,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 36 statements. [2025-03-16 14:05:01,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 14:05:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:01,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 14:05:01,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:05:02,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:05:02,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325779747] [2025-03-16 14:05:02,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325779747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:02,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:02,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 14:05:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986856988] [2025-03-16 14:05:02,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:02,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 14:05:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:02,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 14:05:02,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:05:02,080 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:02,319 INFO L93 Difference]: Finished difference Result 143 states and 192 transitions. [2025-03-16 14:05:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:05:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-16 14:05:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:02,321 INFO L225 Difference]: With dead ends: 143 [2025-03-16 14:05:02,321 INFO L226 Difference]: Without dead ends: 111 [2025-03-16 14:05:02,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:05:02,322 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:02,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 984 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:05:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-16 14:05:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2025-03-16 14:05:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.273972602739726) internal successors, (93), 76 states have internal predecessors, (93), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (24), 16 states have call predecessors, (24), 16 states have call successors, (24) [2025-03-16 14:05:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2025-03-16 14:05:02,332 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 36 [2025-03-16 14:05:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:02,333 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2025-03-16 14:05:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2025-03-16 14:05:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:05:02,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:02,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:02,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:05:02,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:02,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:02,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1329876305, now seen corresponding path program 1 times [2025-03-16 14:05:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531820001] [2025-03-16 14:05:02,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:02,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:02,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:02,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:02,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:05:02,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:05:02,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:05:02,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:02,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:02,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:05:02,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:05:02,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:05:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:05:02,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531820001] [2025-03-16 14:05:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531820001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:05:02,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:05:02,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-16 14:05:02,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743574693] [2025-03-16 14:05:02,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:05:02,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:05:02,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:02,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:05:02,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:05:02,682 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:05:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:02,765 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2025-03-16 14:05:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:05:02,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-16 14:05:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:02,767 INFO L225 Difference]: With dead ends: 203 [2025-03-16 14:05:02,767 INFO L226 Difference]: Without dead ends: 158 [2025-03-16 14:05:02,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:05:02,768 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 34 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:02,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 651 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:05:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-16 14:05:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2025-03-16 14:05:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 101 states have internal predecessors, (125), 26 states have call successors, (26), 10 states have call predecessors, (26), 12 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2025-03-16 14:05:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2025-03-16 14:05:02,792 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 36 [2025-03-16 14:05:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:02,792 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2025-03-16 14:05:02,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:05:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2025-03-16 14:05:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:05:02,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:02,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:02,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:05:03,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:03,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1358505456, now seen corresponding path program 1 times [2025-03-16 14:05:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399694454] [2025-03-16 14:05:03,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:03,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:03,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:03,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:03,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:05:03,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:05:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:05:03,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:03,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:03,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:05:03,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:05:03,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:05:03,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399694454] [2025-03-16 14:05:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399694454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:05:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717427661] [2025-03-16 14:05:03,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 14:05:03,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 14:05:03,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 14:05:03,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-16 14:05:03,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:05:03,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:05:03,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:03,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:03,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:05:03,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 14:05:03,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:05:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [717427661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:05:03,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:05:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2025-03-16 14:05:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107494650] [2025-03-16 14:05:03,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:05:03,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:05:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:05:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:05:03,516 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:05:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:03,673 INFO L93 Difference]: Finished difference Result 168 states and 218 transitions. [2025-03-16 14:05:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 14:05:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-16 14:05:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:03,675 INFO L225 Difference]: With dead ends: 168 [2025-03-16 14:05:03,675 INFO L226 Difference]: Without dead ends: 166 [2025-03-16 14:05:03,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-16 14:05:03,676 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 36 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:03,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 929 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:05:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-16 14:05:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2025-03-16 14:05:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 107 states have internal predecessors, (131), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2025-03-16 14:05:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 192 transitions. [2025-03-16 14:05:03,698 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 192 transitions. Word has length 36 [2025-03-16 14:05:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:03,698 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 192 transitions. [2025-03-16 14:05:03,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 14:05:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 192 transitions. [2025-03-16 14:05:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:05:03,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:03,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:03,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:05:03,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-16 14:05:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-16 14:05:04,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:04,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash -789402332, now seen corresponding path program 1 times [2025-03-16 14:05:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:04,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876926532] [2025-03-16 14:05:04,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:04,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:05:04,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:05:04,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:05:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:04,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:04,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:05:04,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 14:05:04,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:05:04,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876926532] [2025-03-16 14:05:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876926532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:05:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231223709] [2025-03-16 14:05:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:04,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:05:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:04,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:05:04,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:05:04,206 INFO L87 Difference]: Start difference. First operand 145 states and 192 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:04,286 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2025-03-16 14:05:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:05:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-16 14:05:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:04,288 INFO L225 Difference]: With dead ends: 161 [2025-03-16 14:05:04,288 INFO L226 Difference]: Without dead ends: 159 [2025-03-16 14:05:04,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:05:04,288 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:04,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 288 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-16 14:05:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-03-16 14:05:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 112 states have internal predecessors, (136), 27 states have call successors, (27), 13 states have call predecessors, (27), 15 states have return successors, (36), 25 states have call predecessors, (36), 26 states have call successors, (36) [2025-03-16 14:05:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2025-03-16 14:05:04,308 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 36 [2025-03-16 14:05:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2025-03-16 14:05:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2025-03-16 14:05:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:05:04,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:04,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:04,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 14:05:04,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:04,511 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash -760773181, now seen corresponding path program 1 times [2025-03-16 14:05:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116856013] [2025-03-16 14:05:04,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:04,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:04,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 14:05:04,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:05:04,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:05:04,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:04,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:04,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 14:05:04,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 14:05:04,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:05:04,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116856013] [2025-03-16 14:05:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116856013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:05:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:05:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:05:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237519579] [2025-03-16 14:05:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:05:04,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:05:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:04,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:05:04,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:05:04,624 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:04,691 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2025-03-16 14:05:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:05:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-16 14:05:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:04,692 INFO L225 Difference]: With dead ends: 157 [2025-03-16 14:05:04,692 INFO L226 Difference]: Without dead ends: 155 [2025-03-16 14:05:04,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:05:04,693 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:04,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:05:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-16 14:05:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2025-03-16 14:05:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 110 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 15 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2025-03-16 14:05:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 195 transitions. [2025-03-16 14:05:04,711 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 195 transitions. Word has length 36 [2025-03-16 14:05:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:04,712 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 195 transitions. [2025-03-16 14:05:04,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 14:05:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 195 transitions. [2025-03-16 14:05:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 14:05:04,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:04,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:04,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 14:05:04,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:04,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:04,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1906282669, now seen corresponding path program 1 times [2025-03-16 14:05:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889686910] [2025-03-16 14:05:04,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:04,916 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:04,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 14:05:04,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:05:04,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:05:04,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:04,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:05:04,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 14:05:04,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:05:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:05:05,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:05:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:05:05,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:05:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889686910] [2025-03-16 14:05:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889686910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:05:05,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:05:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2025-03-16 14:05:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142083174] [2025-03-16 14:05:05,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:05:05,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 14:05:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:05:05,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 14:05:05,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-16 14:05:05,765 INFO L87 Difference]: Start difference. First operand 149 states and 195 transitions. Second operand has 27 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 20 states have internal predecessors, (38), 8 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 14:05:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:05:06,569 INFO L93 Difference]: Finished difference Result 245 states and 326 transitions. [2025-03-16 14:05:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 14:05:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 20 states have internal predecessors, (38), 8 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2025-03-16 14:05:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:05:06,572 INFO L225 Difference]: With dead ends: 245 [2025-03-16 14:05:06,572 INFO L226 Difference]: Without dead ends: 217 [2025-03-16 14:05:06,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 14:05:06,573 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 58 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:05:06,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1882 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:05:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-16 14:05:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2025-03-16 14:05:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 146 states have internal predecessors, (177), 39 states have call successors, (39), 17 states have call predecessors, (39), 19 states have return successors, (48), 36 states have call predecessors, (48), 38 states have call successors, (48) [2025-03-16 14:05:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 264 transitions. [2025-03-16 14:05:06,601 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 264 transitions. Word has length 42 [2025-03-16 14:05:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:05:06,601 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 264 transitions. [2025-03-16 14:05:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 20 states have internal predecessors, (38), 8 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 14:05:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 264 transitions. [2025-03-16 14:05:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 14:05:06,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:05:06,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:06,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 14:05:06,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:06,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:05:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:05:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1253780992, now seen corresponding path program 1 times [2025-03-16 14:05:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:05:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831628926] [2025-03-16 14:05:06,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:05:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:05:06,807 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:05:06,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 14:05:06,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:05:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:05:06,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:05:06,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 14:05:06,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 14:05:06,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 14:05:06,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:05:06,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:05:06,881 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-16 14:05:06,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 14:05:06,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:05:06,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 14:05:07,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:05:07,088 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:05:07,115 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:05:07,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:05:07 BoogieIcfgContainer [2025-03-16 14:05:07,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:05:07,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:05:07,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:05:07,119 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:05:07,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:05:00" (3/4) ... [2025-03-16 14:05:07,120 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 14:05:07,164 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-03-16 14:05:07,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:05:07,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:05:07,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:05:07,210 INFO L158 Benchmark]: Toolchain (without parser) took 7727.68ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 66.9MB in the end (delta: 25.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,211 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.31ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 78.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.39ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 77.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,211 INFO L158 Benchmark]: Boogie Preprocessor took 35.05ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,212 INFO L158 Benchmark]: IcfgBuilder took 324.17ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 60.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:05:07,212 INFO L158 Benchmark]: TraceAbstraction took 7031.77ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 72.5MB in the end (delta: -13.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,212 INFO L158 Benchmark]: Witness Printer took 90.86ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 66.9MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:05:07,213 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.31ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 78.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.39ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 77.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.05ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 324.17ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 60.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7031.77ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 72.5MB in the end (delta: -13.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 90.86ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 66.9MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=67108864] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=67108864, __retres4=-1, m=67108864] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=67108864, \result=-1, m=67108864] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=127, ma=67108864] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-16, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-16, \old(m)=16777216, e=-16, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-16, \old(m)=16777216, e=-16, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-16, \old(m)=16777216, e=-16, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-16, \old(m)=16777216, e=-16, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-16, \old(m)=16777216, __retres4=1879048192] [L80] return (__retres4); VAL [\old(e)=-16, \old(m)=16777216, \result=1879048192] [L243] RET, EXPR base2flt(mb, eb) VAL [a=-1, ea=127, eb=-16, ma=67108864, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-1, \old(b)=1879048192] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=-1, \old(b)=1879048192, a=-1, b=1879048192] [L94] COND FALSE !(a < b) VAL [\old(a)=-1, \old(b)=1879048192, a=-1, b=1879048192] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=-1, \old(b)=1879048192, a=-1, ea=127, eb=-16, ma=33554431, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=-1, \old(b)=1879048192, a=-1, ea=127, eb=-16, ma=33554431, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-1, \old(b)=1879048192, a=-1, delta=143, ea=127, ma=33554431, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 80 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 6386 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5661 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1238 IncrementalHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 725 mSDtfsCounter, 1238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 113 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 396 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 481 ConstructedInterpolants, 8 QuantifiedInterpolants, 1243 SizeOfPredicates, 24 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 214/237 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 14:05:07,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE