./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 00:53:45,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:45,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:53:45,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:45,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:45,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:45,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:45,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:45,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:45,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:45,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:45,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:45,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:45,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:45,928 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:45,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:45,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:45,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:45,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:45,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:45,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:45,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:53:45,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:45,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:45,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:45,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:45,931 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-08 00:53:46,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:46,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:46,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:46,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:46,164 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:46,165 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-08 00:53:47,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55dd23f81/b328fe3d2d7f4077836cfafe9a2f1d1f/FLAGa3a932b89 [2025-03-08 00:53:47,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:47,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-08 00:53:47,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55dd23f81/b328fe3d2d7f4077836cfafe9a2f1d1f/FLAGa3a932b89 [2025-03-08 00:53:47,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55dd23f81/b328fe3d2d7f4077836cfafe9a2f1d1f [2025-03-08 00:53:47,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:47,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:47,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:47,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:47,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:47,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:47" (1/1) ... [2025-03-08 00:53:47,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:47, skipping insertion in model container [2025-03-08 00:53:47,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:47" (1/1) ... [2025-03-08 00:53:47,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:47,974 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-08 00:53:48,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:48,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:48,016 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-08 00:53:48,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:48,053 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:48,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48 WrapperNode [2025-03-08 00:53:48,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:48,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:48,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:48,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:48,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,078 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-03-08 00:53:48,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:48,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:48,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:48,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:48,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,092 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-08 00:53:48,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:48,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:48,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:48,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:48,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (1/1) ... [2025-03-08 00:53:48,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:48,127 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-08 00:53:48,129 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-08 00:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-08 00:53:48,143 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-08 00:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:48,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-08 00:53:48,143 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-08 00:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 00:53:48,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 00:53:48,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:48,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:48,481 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:48,482 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:48,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:48,502 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 00:53:48,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:48 BoogieIcfgContainer [2025-03-08 00:53:48,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:48,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:48,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:48,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:48,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:47" (1/3) ... [2025-03-08 00:53:48,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ceb0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:48, skipping insertion in model container [2025-03-08 00:53:48,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:48" (2/3) ... [2025-03-08 00:53:48,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ceb0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:48, skipping insertion in model container [2025-03-08 00:53:48,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:48" (3/3) ... [2025-03-08 00:53:48,510 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-03-08 00:53:48,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:48,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 76 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:53:48,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:48,582 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;@52b5cb39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:48,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 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-08 00:53:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:53:48,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:48,593 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, 1] [2025-03-08 00:53:48,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 180636857, now seen corresponding path program 1 times [2025-03-08 00:53:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321707806] [2025-03-08 00:53:48,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:48,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:53:48,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:53:48,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:48,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,016 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-08 00:53:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321707806] [2025-03-08 00:53:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321707806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480382425] [2025-03-08 00:53:49,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:49,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:49,021 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-08 00:53:49,022 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-08 00:53:49,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:53:49,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:53:49,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:49,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:53:49,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:49,154 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-08 00:53:49,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480382425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-03-08 00:53:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062856297] [2025-03-08 00:53:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:49,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:53:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:49,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:53:49,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:53:49,173 INFO L87 Difference]: Start difference. First operand has 76 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 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.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:49,291 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2025-03-08 00:53:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-08 00:53:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:49,300 INFO L225 Difference]: With dead ends: 169 [2025-03-08 00:53:49,301 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:53:49,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 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-08 00:53:49,306 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 14 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 633 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-08 00:53:49,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 633 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:53:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2025-03-08 00:53:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.373134328358209) internal successors, (92), 69 states have internal predecessors, (92), 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-08 00:53:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-03-08 00:53:49,333 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 35 [2025-03-08 00:53:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-03-08 00:53:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-03-08 00:53:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:53:49,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:49,338 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] [2025-03-08 00:53:49,344 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-08 00:53:49,539 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-08 00:53:49,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1550894476, now seen corresponding path program 1 times [2025-03-08 00:53:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812823644] [2025-03-08 00:53:49,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:53:49,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:53:49,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:49,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,722 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-08 00:53:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812823644] [2025-03-08 00:53:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812823644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300868222] [2025-03-08 00:53:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:49,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:49,726 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-08 00:53:49,727 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-08 00:53:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:53:49,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:53:49,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:49,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:53:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:49,806 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-08 00:53:49,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:49,940 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-08 00:53:49,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300868222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:49,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:53:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132606940] [2025-03-08 00:53:49,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:53:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:49,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:53:49,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:53:49,943 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 12 states have internal predecessors, (34), 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-08 00:53:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:50,101 INFO L93 Difference]: Finished difference Result 154 states and 210 transitions. [2025-03-08 00:53:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:53:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 12 states have internal predecessors, (34), 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 38 [2025-03-08 00:53:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:50,103 INFO L225 Difference]: With dead ends: 154 [2025-03-08 00:53:50,103 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 00:53:50,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 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-08 00:53:50,104 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 23 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:50,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 948 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 00:53:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2025-03-08 00:53:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 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-08 00:53:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2025-03-08 00:53:50,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 38 [2025-03-08 00:53:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:50,115 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2025-03-08 00:53:50,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 12 states have internal predecessors, (34), 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-08 00:53:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2025-03-08 00:53:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:53:50,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:50,117 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] [2025-03-08 00:53:50,123 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-08 00:53:50,317 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-08 00:53:50,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1858425977, now seen corresponding path program 2 times [2025-03-08 00:53:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356978029] [2025-03-08 00:53:50,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:50,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:53:50,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 41 statements. [2025-03-08 00:53:50,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:53:50,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:50,509 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-08 00:53:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356978029] [2025-03-08 00:53:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356978029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 00:53:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541966794] [2025-03-08 00:53:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:50,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:53:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:50,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:53:50,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:53:50,511 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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-08 00:53:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:50,766 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2025-03-08 00:53:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:53:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 41 [2025-03-08 00:53:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:50,768 INFO L225 Difference]: With dead ends: 224 [2025-03-08 00:53:50,768 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 00:53:50,769 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-08 00:53:50,769 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 94 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:50,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1419 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 00:53:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2025-03-08 00:53:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.336283185840708) internal successors, (151), 116 states have internal predecessors, (151), 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-08 00:53:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2025-03-08 00:53:50,785 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 41 [2025-03-08 00:53:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:50,785 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2025-03-08 00:53:50,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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-08 00:53:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2025-03-08 00:53:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:53:50,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:50,787 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] [2025-03-08 00:53:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:53:50,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1661912472, now seen corresponding path program 1 times [2025-03-08 00:53:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305387998] [2025-03-08 00:53:50,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:50,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:53:50,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:53:50,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:50,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:50,962 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-08 00:53:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305387998] [2025-03-08 00:53:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305387998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916664991] [2025-03-08 00:53:50,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:50,964 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-08 00:53:50,966 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-08 00:53:50,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:53:51,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:53:51,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:53:51,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:51,197 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-08 00:53:51,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916664991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:51,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:51,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2025-03-08 00:53:51,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396094446] [2025-03-08 00:53:51,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:51,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:53:51,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:51,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:53:51,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:53:51,198 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 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-08 00:53:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,459 INFO L93 Difference]: Finished difference Result 305 states and 426 transitions. [2025-03-08 00:53:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:53:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 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 41 [2025-03-08 00:53:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,461 INFO L225 Difference]: With dead ends: 305 [2025-03-08 00:53:51,461 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 00:53:51,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:53:51,462 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 67 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:51,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1623 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 00:53:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2025-03-08 00:53:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 175 states have (on average 1.3314285714285714) internal successors, (233), 178 states have internal predecessors, (233), 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-08 00:53:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 294 transitions. [2025-03-08 00:53:51,486 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 294 transitions. Word has length 41 [2025-03-08 00:53:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,486 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 294 transitions. [2025-03-08 00:53:51,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 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-08 00:53:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 294 transitions. [2025-03-08 00:53:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:53:51,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,490 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, 1] [2025-03-08 00:53:51,496 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-08 00:53:51,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:51,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1164403404, now seen corresponding path program 1 times [2025-03-08 00:53:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077999502] [2025-03-08 00:53:51,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:53:51,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:53:51,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,820 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-08 00:53:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077999502] [2025-03-08 00:53:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077999502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:53:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911581576] [2025-03-08 00:53:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:51,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:53:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:51,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:53:51,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:53:51,823 INFO L87 Difference]: Start difference. First operand 214 states and 294 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 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-08 00:53:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,920 INFO L93 Difference]: Finished difference Result 297 states and 409 transitions. [2025-03-08 00:53:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:53:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 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 43 [2025-03-08 00:53:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,922 INFO L225 Difference]: With dead ends: 297 [2025-03-08 00:53:51,922 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 00:53:51,922 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-08 00:53:51,922 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 83 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 717 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-08 00:53:51,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 717 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 00:53:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2025-03-08 00:53:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 205 states have (on average 1.3414634146341464) internal successors, (275), 208 states have internal predecessors, (275), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (39), 29 states have call predecessors, (39), 29 states have call successors, (39) [2025-03-08 00:53:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 344 transitions. [2025-03-08 00:53:51,944 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 344 transitions. Word has length 43 [2025-03-08 00:53:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,945 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 344 transitions. [2025-03-08 00:53:51,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 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-08 00:53:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 344 transitions. [2025-03-08 00:53:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:53:51,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,947 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, 1] [2025-03-08 00:53:51,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:53:51,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1360916909, now seen corresponding path program 1 times [2025-03-08 00:53:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148726955] [2025-03-08 00:53:51,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:53:51,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:53:51,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:52,060 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-08 00:53:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148726955] [2025-03-08 00:53:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148726955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458676180] [2025-03-08 00:53:52,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:52,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:52,063 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-08 00:53:52,064 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-08 00:53:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:53:52,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:53:52,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:52,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:53:52,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:52,135 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-08 00:53:52,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:52,241 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-08 00:53:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458676180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:52,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 00:53:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275257511] [2025-03-08 00:53:52,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:52,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:53:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:52,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:53:52,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:53:52,242 INFO L87 Difference]: Start difference. First operand 249 states and 344 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 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-08 00:53:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:52,351 INFO L93 Difference]: Finished difference Result 343 states and 473 transitions. [2025-03-08 00:53:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:52,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 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 43 [2025-03-08 00:53:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:52,353 INFO L225 Difference]: With dead ends: 343 [2025-03-08 00:53:52,354 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 00:53:52,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 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-08 00:53:52,357 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 17 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:52,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1082 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 00:53:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2025-03-08 00:53:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 212 states have (on average 1.330188679245283) internal successors, (282), 215 states have internal predecessors, (282), 32 states have call successors, (32), 12 states have call predecessors, (32), 14 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-08 00:53:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2025-03-08 00:53:52,382 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 43 [2025-03-08 00:53:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2025-03-08 00:53:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 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-08 00:53:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2025-03-08 00:53:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:53:52,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:52,384 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] [2025-03-08 00:53:52,390 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-08 00:53:52,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:52,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:52,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash -301140198, now seen corresponding path program 1 times [2025-03-08 00:53:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:52,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467662685] [2025-03-08 00:53:52,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:52,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:53:52,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:53:52,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:52,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:52,796 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-08 00:53:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467662685] [2025-03-08 00:53:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467662685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:52,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 00:53:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244725857] [2025-03-08 00:53:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:53:52,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:52,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:53:52,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:53:52,801 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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-08 00:53:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:53,003 INFO L93 Difference]: Finished difference Result 359 states and 487 transitions. [2025-03-08 00:53:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:53:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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 44 [2025-03-08 00:53:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:53,005 INFO L225 Difference]: With dead ends: 359 [2025-03-08 00:53:53,005 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 00:53:53,005 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-08 00:53:53,006 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 56 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:53,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 952 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 00:53:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 264. [2025-03-08 00:53:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 218 states have internal predecessors, (286), 33 states have call successors, (33), 12 states have call predecessors, (33), 14 states have return successors, (42), 33 states have call predecessors, (42), 32 states have call successors, (42) [2025-03-08 00:53:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 361 transitions. [2025-03-08 00:53:53,031 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 361 transitions. Word has length 44 [2025-03-08 00:53:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:53,031 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 361 transitions. [2025-03-08 00:53:53,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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-08 00:53:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 361 transitions. [2025-03-08 00:53:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:53:53,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:53,032 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-08 00:53:53,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:53:53,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1874080136, now seen corresponding path program 1 times [2025-03-08 00:53:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522604744] [2025-03-08 00:53:53,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:53,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:53:53,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:53:53,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:53,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:53,057 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-08 00:53:53,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:53,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522604744] [2025-03-08 00:53:53,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522604744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:53,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096211769] [2025-03-08 00:53:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:53,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:53,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:53,058 INFO L87 Difference]: Start difference. First operand 264 states and 361 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-08 00:53:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:53,101 INFO L93 Difference]: Finished difference Result 531 states and 734 transitions. [2025-03-08 00:53:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:53,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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 44 [2025-03-08 00:53:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:53,103 INFO L225 Difference]: With dead ends: 531 [2025-03-08 00:53:53,104 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 00:53:53,104 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-08 00:53:53,105 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 165 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-08 00:53:53,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 00:53:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2025-03-08 00:53:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 218 states have (on average 1.3256880733944953) internal successors, (289), 220 states have internal predecessors, (289), 33 states have call successors, (33), 12 states have call predecessors, (33), 14 states have return successors, (42), 33 states have call predecessors, (42), 32 states have call successors, (42) [2025-03-08 00:53:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2025-03-08 00:53:53,118 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 44 [2025-03-08 00:53:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:53,118 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2025-03-08 00:53:53,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-08 00:53:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2025-03-08 00:53:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:53,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:53,119 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, 1] [2025-03-08 00:53:53,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:53:53,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:53,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash -446994500, now seen corresponding path program 1 times [2025-03-08 00:53:53,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:53,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520233543] [2025-03-08 00:53:53,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:53,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:53,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:53,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:53,168 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-08 00:53:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520233543] [2025-03-08 00:53:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520233543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:53,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:53:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956195176] [2025-03-08 00:53:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:53,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:53,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:53,169 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-08 00:53:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:53,209 INFO L93 Difference]: Finished difference Result 274 states and 371 transitions. [2025-03-08 00:53:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:53:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 46 [2025-03-08 00:53:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:53,211 INFO L225 Difference]: With dead ends: 274 [2025-03-08 00:53:53,211 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 00:53:53,211 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-08 00:53:53,212 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 446 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-08 00:53:53,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 446 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 00:53:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-08 00:53:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 213 states have (on average 1.3286384976525822) internal successors, (283), 216 states have internal predecessors, (283), 31 states have call successors, (31), 12 states have call predecessors, (31), 14 states have return successors, (39), 30 states have call predecessors, (39), 30 states have call successors, (39) [2025-03-08 00:53:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 353 transitions. [2025-03-08 00:53:53,227 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 353 transitions. Word has length 46 [2025-03-08 00:53:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:53,227 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 353 transitions. [2025-03-08 00:53:53,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-08 00:53:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 353 transitions. [2025-03-08 00:53:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:53,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:53,228 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] [2025-03-08 00:53:53,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:53:53,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash -710751354, now seen corresponding path program 1 times [2025-03-08 00:53:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79670777] [2025-03-08 00:53:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:53,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:53,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:53,358 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-08 00:53:53,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:53,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79670777] [2025-03-08 00:53:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79670777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:53,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:53:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240385388] [2025-03-08 00:53:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:53,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:53:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:53,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:53:53,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:53:53,359 INFO L87 Difference]: Start difference. First operand 259 states and 353 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 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-08 00:53:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:53,435 INFO L93 Difference]: Finished difference Result 278 states and 373 transitions. [2025-03-08 00:53:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:53:53,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 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 46 [2025-03-08 00:53:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:53,437 INFO L225 Difference]: With dead ends: 278 [2025-03-08 00:53:53,437 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:53:53,437 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-08 00:53:53,437 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 11 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:53,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 710 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:53:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2025-03-08 00:53:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 189 states have (on average 1.312169312169312) internal successors, (248), 192 states have internal predecessors, (248), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (36), 27 states have call predecessors, (36), 27 states have call successors, (36) [2025-03-08 00:53:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 312 transitions. [2025-03-08 00:53:53,449 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 312 transitions. Word has length 46 [2025-03-08 00:53:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:53,449 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 312 transitions. [2025-03-08 00:53:53,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 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-08 00:53:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 312 transitions. [2025-03-08 00:53:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:53:53,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:53,450 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] [2025-03-08 00:53:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:53:53,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2072281737, now seen corresponding path program 1 times [2025-03-08 00:53:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144676673] [2025-03-08 00:53:53,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:53,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 00:53:53,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:53:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:53,484 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-08 00:53:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:53,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144676673] [2025-03-08 00:53:53,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144676673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:53,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:53,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161007005] [2025-03-08 00:53:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:53,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:53,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:53,485 INFO L87 Difference]: Start difference. First operand 232 states and 312 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-08 00:53:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:53,521 INFO L93 Difference]: Finished difference Result 467 states and 633 transitions. [2025-03-08 00:53:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:53,522 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 45 [2025-03-08 00:53:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:53,526 INFO L225 Difference]: With dead ends: 467 [2025-03-08 00:53:53,526 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:53:53,527 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-08 00:53:53,528 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 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-08 00:53:53,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:53:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-03-08 00:53:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 191 states have (on average 1.3089005235602094) internal successors, (250), 194 states have internal predecessors, (250), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (36), 27 states have call predecessors, (36), 27 states have call successors, (36) [2025-03-08 00:53:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 314 transitions. [2025-03-08 00:53:53,545 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 314 transitions. Word has length 45 [2025-03-08 00:53:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:53,545 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 314 transitions. [2025-03-08 00:53:53,545 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-08 00:53:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 314 transitions. [2025-03-08 00:53:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:53,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:53,547 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] [2025-03-08 00:53:53,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:53:53,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1245357594, now seen corresponding path program 1 times [2025-03-08 00:53:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118839435] [2025-03-08 00:53:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:53,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:53,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:53,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:53,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:53,722 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-08 00:53:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118839435] [2025-03-08 00:53:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118839435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174900399] [2025-03-08 00:53:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:53,725 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-08 00:53:53,726 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-08 00:53:53,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:53,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:53,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:53,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:53:53,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:53,905 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-08 00:53:53,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:54,236 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-08 00:53:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174900399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:54,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2025-03-08 00:53:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888775743] [2025-03-08 00:53:54,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:54,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:53:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:54,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:53:54,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:53:54,237 INFO L87 Difference]: Start difference. First operand 234 states and 314 transitions. Second operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 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-08 00:53:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:55,687 INFO L93 Difference]: Finished difference Result 455 states and 643 transitions. [2025-03-08 00:53:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 00:53:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 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 47 [2025-03-08 00:53:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:55,689 INFO L225 Difference]: With dead ends: 455 [2025-03-08 00:53:55,689 INFO L226 Difference]: Without dead ends: 430 [2025-03-08 00:53:55,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 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-08 00:53:55,691 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 232 mSDsluCounter, 4032 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:55,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 4216 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:53:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-08 00:53:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 285. [2025-03-08 00:53:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 230 states have (on average 1.291304347826087) internal successors, (297), 238 states have internal predecessors, (297), 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-08 00:53:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 387 transitions. [2025-03-08 00:53:55,712 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 387 transitions. Word has length 47 [2025-03-08 00:53:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:55,712 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 387 transitions. [2025-03-08 00:53:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 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-08 00:53:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 387 transitions. [2025-03-08 00:53:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:55,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:55,714 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, 1] [2025-03-08 00:53:55,720 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-08 00:53:55,918 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,SelfDestructingSolverStorable11 [2025-03-08 00:53:55,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1674856347, now seen corresponding path program 1 times [2025-03-08 00:53:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:55,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897045960] [2025-03-08 00:53:55,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:55,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:55,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:55,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:55,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897045960] [2025-03-08 00:53:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897045960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196221923] [2025-03-08 00:53:55,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:55,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:55,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:55,970 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-08 00:53:55,972 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-08 00:53:55,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:56,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:56,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:56,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:56,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:53:56,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:53:56,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196221923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:56,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:56,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:53:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181954103] [2025-03-08 00:53:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:56,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:56,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:53:56,048 INFO L87 Difference]: Start difference. First operand 285 states and 387 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:53:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:56,090 INFO L93 Difference]: Finished difference Result 572 states and 782 transitions. [2025-03-08 00:53:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-03-08 00:53:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:56,092 INFO L225 Difference]: With dead ends: 572 [2025-03-08 00:53:56,092 INFO L226 Difference]: Without dead ends: 290 [2025-03-08 00:53:56,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:53:56,094 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:56,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 173 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-08 00:53:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2025-03-08 00:53:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 228 states have (on average 1.2894736842105263) internal successors, (294), 236 states have internal predecessors, (294), 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-08 00:53:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2025-03-08 00:53:56,109 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 384 transitions. Word has length 46 [2025-03-08 00:53:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:56,109 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 384 transitions. [2025-03-08 00:53:56,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:53:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 384 transitions. [2025-03-08 00:53:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:56,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:56,110 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] [2025-03-08 00:53:56,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:56,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:56,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:56,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 176106886, now seen corresponding path program 2 times [2025-03-08 00:53:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412298231] [2025-03-08 00:53:56,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:56,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:53:56,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:56,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:56,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:56,492 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-08 00:53:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412298231] [2025-03-08 00:53:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412298231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430484366] [2025-03-08 00:53:56,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:56,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:56,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:56,496 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-08 00:53:56,497 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-08 00:53:56,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:53:56,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:56,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:56,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:56,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:53:56,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:56,650 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-08 00:53:56,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:56,929 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-08 00:53:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430484366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:56,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2025-03-08 00:53:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988491986] [2025-03-08 00:53:56,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:53:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:56,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:53:56,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:53:56,931 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 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-08 00:53:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:58,078 INFO L93 Difference]: Finished difference Result 451 states and 645 transitions. [2025-03-08 00:53:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 00:53:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 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 47 [2025-03-08 00:53:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:58,080 INFO L225 Difference]: With dead ends: 451 [2025-03-08 00:53:58,081 INFO L226 Difference]: Without dead ends: 438 [2025-03-08 00:53:58,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 84 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-08 00:53:58,082 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 300 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:58,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 3451 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:53:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-08 00:53:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 296. [2025-03-08 00:53:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 244 states have internal predecessors, (302), 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-08 00:53:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 410 transitions. [2025-03-08 00:53:58,102 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 410 transitions. Word has length 47 [2025-03-08 00:53:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:58,102 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 410 transitions. [2025-03-08 00:53:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 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-08 00:53:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 410 transitions. [2025-03-08 00:53:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:58,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:58,103 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] [2025-03-08 00:53:58,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:58,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:58,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:58,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 731444282, now seen corresponding path program 1 times [2025-03-08 00:53:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784780620] [2025-03-08 00:53:58,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:58,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:58,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:58,425 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-08 00:53:58,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784780620] [2025-03-08 00:53:58,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784780620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502061169] [2025-03-08 00:53:58,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:58,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:58,427 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-08 00:53:58,429 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-08 00:53:58,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:58,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:58,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:58,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:58,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 00:53:58,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:58,663 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-08 00:53:58,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:42,729 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-08 00:54:42,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502061169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:42,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:54:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 32 [2025-03-08 00:54:42,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134853939] [2025-03-08 00:54:42,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:42,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:54:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:42,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:54:42,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=902, Unknown=8, NotChecked=0, Total=992 [2025-03-08 00:54:42,731 INFO L87 Difference]: Start difference. First operand 296 states and 410 transitions. Second operand has 32 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 24 states have internal predecessors, (61), 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-08 00:54:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:44,535 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2025-03-08 00:54:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:54:44,536 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 24 states have internal predecessors, (61), 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 47 [2025-03-08 00:54:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:44,538 INFO L225 Difference]: With dead ends: 581 [2025-03-08 00:54:44,538 INFO L226 Difference]: Without dead ends: 436 [2025-03-08 00:54:44,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=206, Invalid=1948, Unknown=8, NotChecked=0, Total=2162 [2025-03-08 00:54:44,540 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 295 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:44,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 2113 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 00:54:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-08 00:54:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 389. [2025-03-08 00:54:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 314 states have (on average 1.28343949044586) internal successors, (403), 325 states have internal predecessors, (403), 48 states have call successors, (48), 15 states have call predecessors, (48), 26 states have return successors, (76), 48 states have call predecessors, (76), 47 states have call successors, (76) [2025-03-08 00:54:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2025-03-08 00:54:44,565 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 47 [2025-03-08 00:54:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:44,565 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2025-03-08 00:54:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 24 states have internal predecessors, (61), 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-08 00:54:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2025-03-08 00:54:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:54:44,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:44,566 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] [2025-03-08 00:54:44,572 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-08 00:54:44,766 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,SelfDestructingSolverStorable14 [2025-03-08 00:54:44,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -863155447, now seen corresponding path program 1 times [2025-03-08 00:54:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487219688] [2025-03-08 00:54:44,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:44,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:54:44,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:54:44,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487219688] [2025-03-08 00:54:44,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487219688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495855251] [2025-03-08 00:54:44,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:44,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:44,832 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-08 00:54:44,833 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-08 00:54:44,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:54:44,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:54:44,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:44,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:44,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 00:54:44,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:54:44,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:44,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495855251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:44,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:44,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-03-08 00:54:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079682768] [2025-03-08 00:54:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:44,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:54:44,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:44,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:54:44,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:54:44,930 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-08 00:54:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:45,036 INFO L93 Difference]: Finished difference Result 564 states and 764 transitions. [2025-03-08 00:54:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:54:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 46 [2025-03-08 00:54:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:45,039 INFO L225 Difference]: With dead ends: 564 [2025-03-08 00:54:45,039 INFO L226 Difference]: Without dead ends: 398 [2025-03-08 00:54:45,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:54:45,040 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 59 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:45,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 818 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-08 00:54:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 389. [2025-03-08 00:54:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 314 states have (on average 1.2770700636942676) internal successors, (401), 325 states have internal predecessors, (401), 48 states have call successors, (48), 15 states have call predecessors, (48), 26 states have return successors, (76), 48 states have call predecessors, (76), 47 states have call successors, (76) [2025-03-08 00:54:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 525 transitions. [2025-03-08 00:54:45,064 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 525 transitions. Word has length 46 [2025-03-08 00:54:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 525 transitions. [2025-03-08 00:54:45,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-08 00:54:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 525 transitions. [2025-03-08 00:54:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:54:45,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:45,066 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, 1] [2025-03-08 00:54:45,072 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-08 00:54:45,270 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,SelfDestructingSolverStorable15 [2025-03-08 00:54:45,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1696079606, now seen corresponding path program 1 times [2025-03-08 00:54:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601748592] [2025-03-08 00:54:45,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:45,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:54:45,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:54:45,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:45,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:45,373 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-08 00:54:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601748592] [2025-03-08 00:54:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601748592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40040473] [2025-03-08 00:54:45,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:45,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:45,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:45,376 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-08 00:54:45,377 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-08 00:54:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:54:45,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:54:45,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:45,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:45,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 00:54:45,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:45,500 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-08 00:54:45,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:45,708 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-08 00:54:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40040473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:45,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:54:45,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2025-03-08 00:54:45,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632491352] [2025-03-08 00:54:45,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:54:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:45,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:54:45,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:54:45,709 INFO L87 Difference]: Start difference. First operand 389 states and 525 transitions. Second operand has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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-08 00:54:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:46,137 INFO L93 Difference]: Finished difference Result 509 states and 704 transitions. [2025-03-08 00:54:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:54:46,137 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 49 [2025-03-08 00:54:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:46,140 INFO L225 Difference]: With dead ends: 509 [2025-03-08 00:54:46,140 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 00:54:46,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 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-08 00:54:46,141 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 209 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:46,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1466 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:54:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 00:54:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 391. [2025-03-08 00:54:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 314 states have (on average 1.267515923566879) internal successors, (398), 327 states have internal predecessors, (398), 49 states have call successors, (49), 14 states have call predecessors, (49), 27 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-03-08 00:54:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 534 transitions. [2025-03-08 00:54:46,169 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 534 transitions. Word has length 49 [2025-03-08 00:54:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:46,169 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 534 transitions. [2025-03-08 00:54:46,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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-08 00:54:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 534 transitions. [2025-03-08 00:54:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:54:46,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:46,170 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] [2025-03-08 00:54:46,180 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-08 00:54:46,371 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,SelfDestructingSolverStorable16 [2025-03-08 00:54:46,371 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:46,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1908565026, now seen corresponding path program 1 times [2025-03-08 00:54:46,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:46,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245335780] [2025-03-08 00:54:46,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:46,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:46,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:46,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:46,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:46,428 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-08 00:54:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245335780] [2025-03-08 00:54:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245335780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:54:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740795730] [2025-03-08 00:54:46,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:46,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:54:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:46,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:54:46,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:54:46,429 INFO L87 Difference]: Start difference. First operand 391 states and 534 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-08 00:54:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:46,497 INFO L93 Difference]: Finished difference Result 785 states and 1077 transitions. [2025-03-08 00:54:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:54:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 48 [2025-03-08 00:54:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:46,501 INFO L225 Difference]: With dead ends: 785 [2025-03-08 00:54:46,501 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 00:54:46,503 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-08 00:54:46,503 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 259 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-08 00:54:46,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 259 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 00:54:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 389. [2025-03-08 00:54:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 312 states have (on average 1.2628205128205128) internal successors, (394), 325 states have internal predecessors, (394), 49 states have call successors, (49), 14 states have call predecessors, (49), 27 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-03-08 00:54:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 530 transitions. [2025-03-08 00:54:46,541 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 530 transitions. Word has length 48 [2025-03-08 00:54:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 530 transitions. [2025-03-08 00:54:46,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-08 00:54:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 530 transitions. [2025-03-08 00:54:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:54:46,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:46,542 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, 1] [2025-03-08 00:54:46,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 00:54:46,542 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:46,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 275525938, now seen corresponding path program 1 times [2025-03-08 00:54:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354847662] [2025-03-08 00:54:46,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:46,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:46,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:46,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:46,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:46,703 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-08 00:54:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354847662] [2025-03-08 00:54:46,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354847662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:46,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:46,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 00:54:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219360399] [2025-03-08 00:54:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:46,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:54:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:46,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:54:46,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:54:46,705 INFO L87 Difference]: Start difference. First operand 389 states and 530 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-08 00:54:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:46,789 INFO L93 Difference]: Finished difference Result 395 states and 535 transitions. [2025-03-08 00:54:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:54:46,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 48 [2025-03-08 00:54:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:46,791 INFO L225 Difference]: With dead ends: 395 [2025-03-08 00:54:46,791 INFO L226 Difference]: Without dead ends: 393 [2025-03-08 00:54:46,791 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-08 00:54:46,792 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 12 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 470 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-08 00:54:46,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 470 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-08 00:54:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-08 00:54:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 315 states have (on average 1.2603174603174603) internal successors, (397), 328 states have internal predecessors, (397), 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-08 00:54:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 533 transitions. [2025-03-08 00:54:46,815 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 533 transitions. Word has length 48 [2025-03-08 00:54:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:46,815 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 533 transitions. [2025-03-08 00:54:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-08 00:54:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 533 transitions. [2025-03-08 00:54:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:54:46,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:46,816 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, 1] [2025-03-08 00:54:46,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 00:54:46,817 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:46,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -405715158, now seen corresponding path program 1 times [2025-03-08 00:54:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601325244] [2025-03-08 00:54:46,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:46,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:54:46,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:54:46,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:46,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:46,998 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-08 00:54:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601325244] [2025-03-08 00:54:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601325244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694034535] [2025-03-08 00:54:46,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:46,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:47,001 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-08 00:54:47,003 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-08 00:54:47,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:54:47,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:54:47,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:47,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:47,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 00:54:47,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:47,074 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-08 00:54:47,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:47,306 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-08 00:54:47,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694034535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:47,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:54:47,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:54:47,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407398491] [2025-03-08 00:54:47,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:47,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:54:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:47,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:54:47,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:54:47,307 INFO L87 Difference]: Start difference. First operand 393 states and 533 transitions. Second operand has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 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-08 00:54:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:47,840 INFO L93 Difference]: Finished difference Result 482 states and 673 transitions. [2025-03-08 00:54:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:54:47,841 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 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 54 [2025-03-08 00:54:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:47,842 INFO L225 Difference]: With dead ends: 482 [2025-03-08 00:54:47,843 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 00:54:47,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 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-08 00:54:47,844 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 208 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:47,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1573 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:54:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 00:54:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 379. [2025-03-08 00:54:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 305 states have (on average 1.2688524590163934) internal successors, (387), 317 states have internal predecessors, (387), 47 states have call successors, (47), 13 states have call predecessors, (47), 26 states have return successors, (83), 48 states have call predecessors, (83), 46 states have call successors, (83) [2025-03-08 00:54:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 517 transitions. [2025-03-08 00:54:47,869 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 517 transitions. Word has length 54 [2025-03-08 00:54:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:47,869 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 517 transitions. [2025-03-08 00:54:47,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 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-08 00:54:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 517 transitions. [2025-03-08 00:54:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:54:47,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:47,871 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, 1] [2025-03-08 00:54:47,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:54:48,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:48,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:48,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1401306028, now seen corresponding path program 1 times [2025-03-08 00:54:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879389169] [2025-03-08 00:54:48,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:48,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:54:48,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:54:48,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:48,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:54:48,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:54:48,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:54:48,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:54:48,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:48,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:54:48,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:54:48,133 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:54:48,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:54:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 00:54:48,137 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-08 00:54:48,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:54:48,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:54:48 BoogieIcfgContainer [2025-03-08 00:54:48,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:54:48,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:54:48,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:54:48,169 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:54:48,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:48" (3/4) ... [2025-03-08 00:54:48,171 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 00:54:48,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:54:48,172 INFO L158 Benchmark]: Toolchain (without parser) took 60300.01ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 104.8MB in the beginning and 304.7MB in the end (delta: -199.9MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-03-08 00:54:48,172 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:48,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.35ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:48,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.45ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:48,173 INFO L158 Benchmark]: Boogie Preprocessor took 22.81ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:48,173 INFO L158 Benchmark]: IcfgBuilder took 400.79ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 67.4MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:54:48,174 INFO L158 Benchmark]: TraceAbstraction took 59664.06ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 67.4MB in the beginning and 304.8MB in the end (delta: -237.4MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. [2025-03-08 00:54:48,175 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 352.3MB. Free memory was 304.8MB in the beginning and 304.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:48,175 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.72ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.35ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.45ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.81ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 400.79ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 67.4MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 59664.06ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 67.4MB in the beginning and 304.8MB in the end (delta: -237.4MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 352.3MB. Free memory was 304.8MB in the beginning and 304.7MB in the end (delta: 92.3kB). 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)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=33554431] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=33554431, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=33554431, \result=16777216] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=-127, ma=33554432, mb=33554431] [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, 76 locations, 119 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.6s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1832 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1710 mSDsluCounter, 23404 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21179 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7641 IncrementalHoareTripleChecker+Invalid, 7912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 2225 mSDtfsCounter, 7641 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 754 SyntacticMatches, 1 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 47.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=19, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 704 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 48.6s InterpolantComputationTime, 1445 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1678 ConstructedInterpolants, 10 QuantifiedInterpolants, 4377 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1602 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 38 InterpolantComputations, 13 PerfectInterpolantSequences, 612/716 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-08 00:54:48,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-?-e2fb8be-m [2025-03-08 00:54:50,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:54:50,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 00:54:50,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:54:50,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:54:50,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:54:50,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:54:50,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:54:50,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:54:50,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:54:50,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:54:50,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:54:50,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:54:50,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:54:50,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:54:50,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:54:50,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:54:50,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:54:50,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:54:50,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:54:50,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:50,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:54:50,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:54:50,116 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 00:54:50,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:50,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:54:50,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:54:50,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:54:50,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:54:50,116 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-08 00:54:50,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:54:50,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:54:50,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:54:50,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:54:50,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:54:50,361 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-08 00:54:51,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd75bd13/31dcbc1ecc5f4460a2be6b57045098f4/FLAGe4d973704 [2025-03-08 00:54:51,724 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:54:51,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-08 00:54:51,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd75bd13/31dcbc1ecc5f4460a2be6b57045098f4/FLAGe4d973704 [2025-03-08 00:54:51,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd75bd13/31dcbc1ecc5f4460a2be6b57045098f4 [2025-03-08 00:54:51,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:54:51,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:54:51,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:51,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:54:51,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:54:51,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:51,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c411522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51, skipping insertion in model container [2025-03-08 00:54:51,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:51,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:54:51,878 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-08 00:54:51,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:51,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:54:51,950 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-08 00:54:51,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:51,985 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:54:51,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51 WrapperNode [2025-03-08 00:54:51,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:51,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:51,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:54:51,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:54:51,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,015 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-03-08 00:54:52,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:52,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:54:52,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:54:52,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:54:52,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,041 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-08 00:54:52,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:54:52,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:54:52,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:54:52,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:54:52,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (1/1) ... [2025-03-08 00:54:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:52,085 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-08 00:54:52,088 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-08 00:54:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:54:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 00:54:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-08 00:54:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-08 00:54:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:54:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:54:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-08 00:54:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-08 00:54:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 00:54:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 00:54:52,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:54:52,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:54:52,367 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-08 00:54:52,367 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:54:52,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:54:52,375 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:54:52,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:52 BoogieIcfgContainer [2025-03-08 00:54:52,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:54:52,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:54:52,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:54:52,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:54:52,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:54:51" (1/3) ... [2025-03-08 00:54:52,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c1d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:52, skipping insertion in model container [2025-03-08 00:54:52,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:51" (2/3) ... [2025-03-08 00:54:52,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c1d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:52, skipping insertion in model container [2025-03-08 00:54:52,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:52" (3/3) ... [2025-03-08 00:54:52,386 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-03-08 00:54:52,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:54:52,397 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 52 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:54:52,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:54:52,442 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;@159589d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:54:52,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:54:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 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-08 00:54:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:54:52,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:52,450 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] [2025-03-08 00:54:52,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -442555839, now seen corresponding path program 1 times [2025-03-08 00:54:52,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810920142] [2025-03-08 00:54:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:52,467 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-08 00:54:52,468 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-08 00:54:52,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:54:52,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:54:52,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:52,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:54:52,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:52,676 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-08 00:54:52,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:52,765 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-08 00:54:52,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810920142] [2025-03-08 00:54:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810920142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:52,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 00:54:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809440369] [2025-03-08 00:54:52,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:54:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:52,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:54:52,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:52,786 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 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 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 00:54:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:52,930 INFO L93 Difference]: Finished difference Result 124 states and 189 transitions. [2025-03-08 00:54:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:54:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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 31 [2025-03-08 00:54:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:52,940 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:54:52,940 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:54:52,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 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-08 00:54:52,947 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 15 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 494 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-08 00:54:52,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 494 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:54:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2025-03-08 00:54:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 46 states have internal predecessors, (59), 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-08 00:54:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2025-03-08 00:54:52,983 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 31 [2025-03-08 00:54:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:52,984 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2025-03-08 00:54:52,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 00:54:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2025-03-08 00:54:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:54:52,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:52,986 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] [2025-03-08 00:54:52,993 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-08 00:54:53,186 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-08 00:54:53,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash -70192803, now seen corresponding path program 1 times [2025-03-08 00:54:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204445710] [2025-03-08 00:54:53,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:53,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:53,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:53,191 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-08 00:54:53,192 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-08 00:54:53,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:54:53,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:54:53,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:53,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:53,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:54:53,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:53,383 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-08 00:54:53,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:53,492 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-08 00:54:53,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204445710] [2025-03-08 00:54:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204445710] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:53,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-03-08 00:54:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797419792] [2025-03-08 00:54:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:53,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:53,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:53,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:53,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:53,496 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:53,614 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2025-03-08 00:54:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:54:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-08 00:54:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:53,616 INFO L225 Difference]: With dead ends: 125 [2025-03-08 00:54:53,617 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 00:54:53,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 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-08 00:54:53,618 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 23 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 493 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-08 00:54:53,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 493 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 00:54:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2025-03-08 00:54:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 64 states have internal predecessors, (81), 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-08 00:54:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2025-03-08 00:54:53,628 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 34 [2025-03-08 00:54:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:53,629 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2025-03-08 00:54:53,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2025-03-08 00:54:53,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:54:53,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:53,630 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] [2025-03-08 00:54:53,636 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-08 00:54:53,830 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-08 00:54:53,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:53,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -41563652, now seen corresponding path program 1 times [2025-03-08 00:54:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131550912] [2025-03-08 00:54:53,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:53,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:53,834 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-08 00:54:53,835 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-08 00:54:53,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:54:53,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:54:53,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:53,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:53,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:54:53,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:53,940 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-08 00:54:53,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:53,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:53,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131550912] [2025-03-08 00:54:53,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131550912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:53,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:53,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 00:54:53,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32974306] [2025-03-08 00:54:53,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:53,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:53,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:53,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:53,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:54:53,942 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:54,025 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2025-03-08 00:54:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-08 00:54:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:54,027 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:54:54,027 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 00:54:54,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:54,027 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 412 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-08 00:54:54,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 412 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 00:54:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2025-03-08 00:54:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.3) internal successors, (65), 52 states have internal predecessors, (65), 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-08 00:54:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2025-03-08 00:54:54,034 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 34 [2025-03-08 00:54:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:54,034 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2025-03-08 00:54:54,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2025-03-08 00:54:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:54,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:54,035 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] [2025-03-08 00:54:54,043 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-08 00:54:54,236 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-08 00:54:54,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:54,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1243386211, now seen corresponding path program 2 times [2025-03-08 00:54:54,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:54,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151706024] [2025-03-08 00:54:54,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:54:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:54,238 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-08 00:54:54,239 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-08 00:54:54,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:54:54,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 37 statements. [2025-03-08 00:54:54,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:54:54,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:54,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:54:54,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:54,404 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-08 00:54:54,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:54,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151706024] [2025-03-08 00:54:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151706024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:54,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 00:54:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960792085] [2025-03-08 00:54:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:54,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:54:54,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:54,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:54:54,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:54:54,406 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-08 00:54:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:54,620 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2025-03-08 00:54:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:54:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 37 [2025-03-08 00:54:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:54,621 INFO L225 Difference]: With dead ends: 144 [2025-03-08 00:54:54,621 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 00:54:54,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:54:54,622 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 38 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 995 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-08 00:54:54,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 995 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 00:54:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2025-03-08 00:54:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 77 states have internal predecessors, (94), 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-08 00:54:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2025-03-08 00:54:54,634 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 37 [2025-03-08 00:54:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:54,634 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2025-03-08 00:54:54,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-08 00:54:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2025-03-08 00:54:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:54,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:54,636 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] [2025-03-08 00:54:54,642 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-08 00:54:54,836 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-08 00:54:54,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:54,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:54,837 INFO L85 PathProgramCache]: Analyzing trace with hash -36303626, now seen corresponding path program 1 times [2025-03-08 00:54:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:54,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386370177] [2025-03-08 00:54:54,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:54,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:54,839 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-08 00:54:54,840 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-08 00:54:54,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:54,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:54,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:54:54,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:54,935 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-08 00:54:54,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:54,986 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-08 00:54:54,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386370177] [2025-03-08 00:54:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386370177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:54,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 00:54:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898422642] [2025-03-08 00:54:54,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:54,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:54,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:54:54,987 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 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-08 00:54:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:55,068 INFO L93 Difference]: Finished difference Result 204 states and 274 transitions. [2025-03-08 00:54:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 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 37 [2025-03-08 00:54:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:55,070 INFO L225 Difference]: With dead ends: 204 [2025-03-08 00:54:55,070 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 00:54:55,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 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-08 00:54:55,071 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 34 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 658 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-08 00:54:55,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 658 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 00:54:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2025-03-08 00:54:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 102 states have internal predecessors, (126), 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-08 00:54:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2025-03-08 00:54:55,096 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 37 [2025-03-08 00:54:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:55,096 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2025-03-08 00:54:55,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 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-08 00:54:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2025-03-08 00:54:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:55,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:55,098 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] [2025-03-08 00:54:55,105 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-08 00:54:55,299 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-08 00:54:55,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -7674475, now seen corresponding path program 1 times [2025-03-08 00:54:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1585321462] [2025-03-08 00:54:55,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:55,301 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-08 00:54:55,302 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-08 00:54:55,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:55,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:55,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:55,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:55,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:55,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:55,452 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-08 00:54:55,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:55,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585321462] [2025-03-08 00:54:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585321462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [658043220] [2025-03-08 00:54:55,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 00:54:55,638 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-08 00:54:55,639 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-08 00:54:55,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:55,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:55,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:55,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:55,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:55,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:55,750 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-08 00:54:55,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [658043220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:55,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2025-03-08 00:54:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989801729] [2025-03-08 00:54:55,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:55,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:54:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:55,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:54:55,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:54:55,777 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 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-08 00:54:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:55,939 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2025-03-08 00:54:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:54:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 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 37 [2025-03-08 00:54:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:55,941 INFO L225 Difference]: With dead ends: 169 [2025-03-08 00:54:55,941 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 00:54:55,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:54:55,942 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 36 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 939 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-08 00:54:55,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 939 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 00:54:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2025-03-08 00:54:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 105 states have (on average 1.2571428571428571) internal successors, (132), 108 states have internal predecessors, (132), 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-08 00:54:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 193 transitions. [2025-03-08 00:54:55,957 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 193 transitions. Word has length 37 [2025-03-08 00:54:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:55,957 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 193 transitions. [2025-03-08 00:54:55,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 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-08 00:54:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 193 transitions. [2025-03-08 00:54:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:55,958 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] [2025-03-08 00:54:55,964 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-08 00:54:56,160 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-08 00:54:56,359 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-08 00:54:56,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:56,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2139385033, now seen corresponding path program 1 times [2025-03-08 00:54:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281113486] [2025-03-08 00:54:56,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:56,362 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-08 00:54:56,363 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-08 00:54:56,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:56,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:56,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:56,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:54:56,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:56,470 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-08 00:54:56,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:56,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281113486] [2025-03-08 00:54:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281113486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:54:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204147948] [2025-03-08 00:54:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:56,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:56,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:56,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:54:56,474 INFO L87 Difference]: Start difference. First operand 146 states and 193 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-08 00:54:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:56,548 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2025-03-08 00:54:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:56,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 37 [2025-03-08 00:54:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:56,553 INFO L225 Difference]: With dead ends: 162 [2025-03-08 00:54:56,553 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 00:54:56,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-08 00:54:56,553 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:56,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 00:54:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-03-08 00:54:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.2568807339449541) internal successors, (137), 113 states have internal predecessors, (137), 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-08 00:54:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 200 transitions. [2025-03-08 00:54:56,584 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 200 transitions. Word has length 37 [2025-03-08 00:54:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:56,584 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 200 transitions. [2025-03-08 00:54:56,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-08 00:54:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2025-03-08 00:54:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:56,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:56,584 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] [2025-03-08 00:54:56,591 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-08 00:54:56,789 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-08 00:54:56,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2126953112, now seen corresponding path program 1 times [2025-03-08 00:54:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569697565] [2025-03-08 00:54:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:56,791 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-08 00:54:56,792 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-08 00:54:56,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:56,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:56,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:56,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:56,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:54:56,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:56,893 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-08 00:54:56,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:56,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569697565] [2025-03-08 00:54:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569697565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:54:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183751540] [2025-03-08 00:54:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:56,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:56,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:56,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:54:56,894 INFO L87 Difference]: Start difference. First operand 152 states and 200 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-08 00:54:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:56,957 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2025-03-08 00:54:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 37 [2025-03-08 00:54:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:56,959 INFO L225 Difference]: With dead ends: 158 [2025-03-08 00:54:56,959 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 00:54:56,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-08 00:54:56,960 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 288 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-08 00:54:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 288 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 00:54:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2025-03-08 00:54:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.25) internal successors, (135), 111 states have internal predecessors, (135), 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-08 00:54:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2025-03-08 00:54:56,970 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 37 [2025-03-08 00:54:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2025-03-08 00:54:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-08 00:54:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2025-03-08 00:54:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:54:56,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:56,971 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] [2025-03-08 00:54:56,977 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-08 00:54:57,171 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-08 00:54:57,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:57,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash 324303282, now seen corresponding path program 1 times [2025-03-08 00:54:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:57,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393636998] [2025-03-08 00:54:57,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:57,174 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-08 00:54:57,175 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-08 00:54:57,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:54:57,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:54:57,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:57,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:57,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:54:57,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:57,391 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-08 00:54:57,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:57,995 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-08 00:54:57,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393636998] [2025-03-08 00:54:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393636998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:57,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:57,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2025-03-08 00:54:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815372827] [2025-03-08 00:54:57,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:57,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:54:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:57,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:54:57,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:54:57,997 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand has 27 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 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-08 00:54:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:58,899 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2025-03-08 00:54:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:54:58,901 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 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 43 [2025-03-08 00:54:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:58,902 INFO L225 Difference]: With dead ends: 246 [2025-03-08 00:54:58,902 INFO L226 Difference]: Without dead ends: 218 [2025-03-08 00:54:58,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 59 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-08 00:54:58,904 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 57 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:58,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 2247 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:54:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-08 00:54:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 201. [2025-03-08 00:54:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.2535211267605635) internal successors, (178), 147 states have internal predecessors, (178), 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-08 00:54:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 265 transitions. [2025-03-08 00:54:58,933 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 265 transitions. Word has length 43 [2025-03-08 00:54:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:58,934 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 265 transitions. [2025-03-08 00:54:58,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 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-08 00:54:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 265 transitions. [2025-03-08 00:54:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:54:58,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:58,936 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] [2025-03-08 00:54:58,943 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-08 00:54:59,136 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-08 00:54:59,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:59,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1459206917, now seen corresponding path program 1 times [2025-03-08 00:54:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705516088] [2025-03-08 00:54:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:59,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:59,139 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-08 00:54:59,141 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-08 00:54:59,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:54:59,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:54:59,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:59,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:54:59,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:54:59,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:54:59,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:54:59,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:59,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:54:59,205 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 00:54:59,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:54:59,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:54:59,212 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-08 00:54:59,407 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-08 00:54:59,410 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:59,425 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:54:59,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:54:59 BoogieIcfgContainer [2025-03-08 00:54:59,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:54:59,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:54:59,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:54:59,427 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:54:59,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:52" (3/4) ... [2025-03-08 00:54:59,428 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 00:54:59,469 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-03-08 00:54:59,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:54:59,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:54:59,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:54:59,522 INFO L158 Benchmark]: Toolchain (without parser) took 7770.99ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 68.1MB in the end (delta: 24.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-08 00:54:59,522 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:59,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.56ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.9MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:54:59,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.38ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:59,523 INFO L158 Benchmark]: Boogie Preprocessor took 37.34ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 76.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:59,523 INFO L158 Benchmark]: IcfgBuilder took 317.95ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 60.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:59,523 INFO L158 Benchmark]: TraceAbstraction took 7049.13ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 75.0MB in the end (delta: -15.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:59,523 INFO L158 Benchmark]: Witness Printer took 94.75ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 68.1MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:54:59,524 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.20ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.56ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.9MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.38ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.34ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 76.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.95ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 60.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7049.13ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 75.0MB in the end (delta: -15.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 94.75ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 68.1MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. 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, 52 locations, 82 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 6819 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6077 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1335 IncrementalHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 742 mSDtfsCounter, 1335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred 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, 407 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 495 ConstructedInterpolants, 8 QuantifiedInterpolants, 1257 SizeOfPredicates, 24 NumberOfNonLiveVariables, 721 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-08 00:54:59,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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