./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 798a7b37 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-?-798a7b3-m [2025-03-03 09:44:18,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:44:18,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:44:18,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:44:18,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:44:19,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:44:19,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:44:19,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:44:19,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:44:19,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:44:19,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:44:19,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:44:19,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:44:19,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:44:19,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:19,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:44:19,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:44:19,010 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-03 09:44:19,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:44:19,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:44:19,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:44:19,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:44:19,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:44:19,222 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-03 09:44:20,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff575c2b/ba88f81652c9471aa7857b4f41d75182/FLAG6d824a2c1 [2025-03-03 09:44:20,604 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:44:20,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-03 09:44:20,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff575c2b/ba88f81652c9471aa7857b4f41d75182/FLAG6d824a2c1 [2025-03-03 09:44:20,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff575c2b/ba88f81652c9471aa7857b4f41d75182 [2025-03-03 09:44:20,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:44:20,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:44:20,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:20,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:44:20,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:44:20,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:20" (1/1) ... [2025-03-03 09:44:20,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2f8520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:20, skipping insertion in model container [2025-03-03 09:44:20,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:20" (1/1) ... [2025-03-03 09:44:20,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:44:21,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-03-03 09:44:21,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:21,082 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:44:21,089 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-03 09:44:21,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:21,131 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:44:21,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21 WrapperNode [2025-03-03 09:44:21,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:21,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:21,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:44:21,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:44:21,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,159 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-03-03 09:44:21,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:21,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:44:21,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:44:21,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:44:21,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,178 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-03 09:44:21,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:44:21,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:44:21,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:44:21,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:44:21,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (1/1) ... [2025-03-03 09:44:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:21,211 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-03 09:44:21,216 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-03 09:44:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:44:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:44:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-03 09:44:21,229 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-03 09:44:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:44:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:44:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-03 09:44:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-03 09:44:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 09:44:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 09:44:21,275 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:44:21,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:44:21,490 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-03 09:44:21,491 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:44:21,513 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:44:21,514 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 09:44:21,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:21 BoogieIcfgContainer [2025-03-03 09:44:21,514 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:44:21,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:44:21,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:44:21,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:44:21,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:20" (1/3) ... [2025-03-03 09:44:21,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2fc647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:21, skipping insertion in model container [2025-03-03 09:44:21,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:21" (2/3) ... [2025-03-03 09:44:21,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2fc647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:21, skipping insertion in model container [2025-03-03 09:44:21,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:21" (3/3) ... [2025-03-03 09:44:21,521 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-03-03 09:44:21,531 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:44:21,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 78 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:44:21,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:44:21,572 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;@717ffb68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:44:21,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:44:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 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-03 09:44:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:44:21,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:21,582 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-03 09:44:21,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash -894104835, now seen corresponding path program 1 times [2025-03-03 09:44:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061370654] [2025-03-03 09:44:21,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:21,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:44:21,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:44:21,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,071 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-03 09:44:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061370654] [2025-03-03 09:44:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061370654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:22,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207682903] [2025-03-03 09:44:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:22,075 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-03 09:44:22,077 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-03 09:44:22,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:44:22,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:44:22,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:44:22,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:22,208 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-03 09:44:22,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207682903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:22,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-03-03 09:44:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323343061] [2025-03-03 09:44:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:22,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:22,229 INFO L87 Difference]: Start difference. First operand has 78 states, 64 states have (on average 1.46875) internal successors, (94), 65 states have internal predecessors, (94), 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-03 09:44:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:22,345 INFO L93 Difference]: Finished difference Result 173 states and 260 transitions. [2025-03-03 09:44:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:22,347 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-03 09:44:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:22,352 INFO L225 Difference]: With dead ends: 173 [2025-03-03 09:44:22,353 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 09:44:22,358 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-03 09:44:22,361 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 647 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-03 09:44:22,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 647 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 09:44:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2025-03-03 09:44:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 71 states have internal predecessors, (94), 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-03 09:44:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions. [2025-03-03 09:44:22,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 35 [2025-03-03 09:44:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 116 transitions. [2025-03-03 09:44:22,390 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-03 09:44:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2025-03-03 09:44:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:22,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:22,397 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] [2025-03-03 09:44:22,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:22,601 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-03 09:44:22,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:22,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -99123177, now seen corresponding path program 1 times [2025-03-03 09:44:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:22,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696946167] [2025-03-03 09:44:22,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:22,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:22,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:22,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,811 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-03 09:44:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696946167] [2025-03-03 09:44:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696946167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094300826] [2025-03-03 09:44:22,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:22,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:22,815 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-03 09:44:22,817 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-03 09:44:22,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:22,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:22,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:44:22,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:22,890 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-03 09:44:22,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:23,009 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-03 09:44:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094300826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:23,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-03 09:44:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268024965] [2025-03-03 09:44:23,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:44:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:23,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:44:23,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:23,013 INFO L87 Difference]: Start difference. First operand 85 states and 116 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 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-03 09:44:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:23,157 INFO L93 Difference]: Finished difference Result 156 states and 212 transitions. [2025-03-03 09:44:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 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 39 [2025-03-03 09:44:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:23,159 INFO L225 Difference]: With dead ends: 156 [2025-03-03 09:44:23,159 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 09:44:23,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 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-03 09:44:23,160 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:23,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1062 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 09:44:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-03-03 09:44:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 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-03 09:44:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2025-03-03 09:44:23,172 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 39 [2025-03-03 09:44:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,172 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2025-03-03 09:44:23,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 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-03 09:44:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2025-03-03 09:44:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:23,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,174 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-03 09:44:23,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:23,374 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-03 09:44:23,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash -198281096, now seen corresponding path program 1 times [2025-03-03 09:44:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276353938] [2025-03-03 09:44:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:23,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,527 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-03 09:44:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276353938] [2025-03-03 09:44:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276353938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:23,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 09:44:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641213367] [2025-03-03 09:44:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:23,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:23,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:23,528 INFO L87 Difference]: Start difference. First operand 95 states and 129 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-03 09:44:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:23,644 INFO L93 Difference]: Finished difference Result 178 states and 244 transitions. [2025-03-03 09:44:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:23,645 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-03 09:44:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:23,646 INFO L225 Difference]: With dead ends: 178 [2025-03-03 09:44:23,646 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 09:44:23,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:23,647 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 83 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 733 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-03 09:44:23,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 733 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 09:44:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2025-03-03 09:44:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 108 states have internal predecessors, (144), 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-03 09:44:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2025-03-03 09:44:23,655 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 43 [2025-03-03 09:44:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2025-03-03 09:44:23,656 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-03 09:44:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2025-03-03 09:44:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:23,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,657 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-03 09:44:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:44:23,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash -394794601, now seen corresponding path program 1 times [2025-03-03 09:44:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309814721] [2025-03-03 09:44:23,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:23,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:23,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,769 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-03 09:44:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309814721] [2025-03-03 09:44:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309814721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297505371] [2025-03-03 09:44:23,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:23,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:23,771 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-03 09:44:23,772 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-03 09:44:23,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:23,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:23,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:44:23,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:23,830 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-03 09:44:23,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:23,947 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-03 09:44:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297505371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:23,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 09:44:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109929800] [2025-03-03 09:44:23,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:44:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:23,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:44:23,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:23,948 INFO L87 Difference]: Start difference. First operand 130 states and 179 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-03 09:44:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:24,034 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2025-03-03 09:44:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:24,035 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-03 09:44:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:24,036 INFO L225 Difference]: With dead ends: 224 [2025-03-03 09:44:24,036 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 09:44:24,036 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-03 09:44:24,037 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:24,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 737 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 09:44:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2025-03-03 09:44:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.336283185840708) internal successors, (151), 115 states have internal predecessors, (151), 18 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-03-03 09:44:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2025-03-03 09:44:24,051 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 43 [2025-03-03 09:44:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2025-03-03 09:44:24,051 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-03 09:44:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2025-03-03 09:44:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:24,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:24,052 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-03 09:44:24,059 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-03 09:44:24,257 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-03 09:44:24,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:24,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash -416119720, now seen corresponding path program 1 times [2025-03-03 09:44:24,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:24,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60346110] [2025-03-03 09:44:24,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:24,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:24,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:24,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:24,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:24,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,494 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-03 09:44:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60346110] [2025-03-03 09:44:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60346110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 09:44:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269499206] [2025-03-03 09:44:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:24,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:44:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:24,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:44:24,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:24,496 INFO L87 Difference]: Start difference. First operand 140 states and 190 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-03 09:44:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:24,719 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2025-03-03 09:44:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:44:24,719 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-03 09:44:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:24,720 INFO L225 Difference]: With dead ends: 203 [2025-03-03 09:44:24,721 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 09:44:24,722 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-03 09:44:24,722 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 51 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:24,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1458 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 09:44:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2025-03-03 09:44:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2025-03-03 09:44:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2025-03-03 09:44:24,742 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 44 [2025-03-03 09:44:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2025-03-03 09:44:24,742 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-03 09:44:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2025-03-03 09:44:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:24,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:24,744 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-03 09:44:24,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:44:24,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:24,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2033888829, now seen corresponding path program 2 times [2025-03-03 09:44:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253054478] [2025-03-03 09:44:24,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:24,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:44:24,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 43 statements. [2025-03-03 09:44:24,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 09:44:24,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:25,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253054478] [2025-03-03 09:44:25,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253054478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:25,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:25,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 09:44:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320748874] [2025-03-03 09:44:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:25,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:44:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:25,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:44:25,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:44:25,032 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-03 09:44:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:25,275 INFO L93 Difference]: Finished difference Result 290 states and 395 transitions. [2025-03-03 09:44:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:25,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 43 [2025-03-03 09:44:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:25,278 INFO L225 Difference]: With dead ends: 290 [2025-03-03 09:44:25,278 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 09:44:25,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:44:25,279 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 131 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:25,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1287 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 09:44:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2025-03-03 09:44:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3132530120481927) internal successors, (218), 169 states have internal predecessors, (218), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-03 09:44:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2025-03-03 09:44:25,297 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 43 [2025-03-03 09:44:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:25,298 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2025-03-03 09:44:25,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-03 09:44:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2025-03-03 09:44:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:25,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:25,299 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-03 09:44:25,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:44:25,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1837375324, now seen corresponding path program 1 times [2025-03-03 09:44:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542327934] [2025-03-03 09:44:25,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:25,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:25,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:25,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:25,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:25,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542327934] [2025-03-03 09:44:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542327934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66286748] [2025-03-03 09:44:25,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:25,430 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-03 09:44:25,432 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-03 09:44:25,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:25,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:25,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:25,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:44:25,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:25,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66286748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2025-03-03 09:44:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345331926] [2025-03-03 09:44:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:25,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:44:25,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:25,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:44:25,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:44:25,614 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:25,810 INFO L93 Difference]: Finished difference Result 375 states and 516 transitions. [2025-03-03 09:44:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:44:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-03 09:44:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:25,813 INFO L225 Difference]: With dead ends: 375 [2025-03-03 09:44:25,814 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 09:44:25,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:44:25,815 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 67 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:25,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1327 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 09:44:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2025-03-03 09:44:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 228 states have (on average 1.3157894736842106) internal successors, (300), 231 states have internal predecessors, (300), 34 states have call successors, (34), 13 states have call predecessors, (34), 15 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2025-03-03 09:44:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 377 transitions. [2025-03-03 09:44:25,833 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 377 transitions. Word has length 43 [2025-03-03 09:44:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:25,833 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 377 transitions. [2025-03-03 09:44:25,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 377 transitions. [2025-03-03 09:44:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:44:25,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:25,834 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-03 09:44:25,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:26,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:26,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 726834618, now seen corresponding path program 1 times [2025-03-03 09:44:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711147334] [2025-03-03 09:44:26,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:44:26,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:44:26,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,091 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-03 09:44:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711147334] [2025-03-03 09:44:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711147334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530710059] [2025-03-03 09:44:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:26,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:26,093 INFO L87 Difference]: Start difference. First operand 278 states and 377 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-03 09:44:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,137 INFO L93 Difference]: Finished difference Result 286 states and 384 transitions. [2025-03-03 09:44:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:26,138 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-03 09:44:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,139 INFO L225 Difference]: With dead ends: 286 [2025-03-03 09:44:26,139 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 09:44:26,139 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-03 09:44:26,139 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 456 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-03 09:44:26,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 456 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 09:44:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-03 09:44:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 223 states have (on average 1.3183856502242153) internal successors, (294), 227 states have internal predecessors, (294), 32 states have call successors, (32), 13 states have call predecessors, (32), 15 states have return successors, (40), 30 states have call predecessors, (40), 31 states have call successors, (40) [2025-03-03 09:44:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 366 transitions. [2025-03-03 09:44:26,158 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 366 transitions. Word has length 46 [2025-03-03 09:44:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,158 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 366 transitions. [2025-03-03 09:44:26,158 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-03 09:44:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 366 transitions. [2025-03-03 09:44:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:44:26,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,159 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-03 09:44:26,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:44:26,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 426388162, now seen corresponding path program 1 times [2025-03-03 09:44:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860541183] [2025-03-03 09:44:26,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:44:26,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:44:26,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860541183] [2025-03-03 09:44:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860541183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620137857] [2025-03-03 09:44:26,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:26,191 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-03 09:44:26,192 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-03 09:44:26,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 09:44:26,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 09:44:26,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:44:26,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:44:26,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620137857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-03 09:44:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958569939] [2025-03-03 09:44:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:26,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:26,244 INFO L87 Difference]: Start difference. First operand 271 states and 366 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-03 09:44:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,287 INFO L93 Difference]: Finished difference Result 544 states and 739 transitions. [2025-03-03 09:44:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:26,287 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-03 09:44:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,289 INFO L225 Difference]: With dead ends: 544 [2025-03-03 09:44:26,289 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 09:44:26,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:26,290 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:26,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 170 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 09:44:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2025-03-03 09:44:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 226 states have (on average 1.3185840707964602) internal successors, (298), 230 states have internal predecessors, (298), 32 states have call successors, (32), 13 states have call predecessors, (32), 15 states have return successors, (40), 30 states have call predecessors, (40), 31 states have call successors, (40) [2025-03-03 09:44:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 370 transitions. [2025-03-03 09:44:26,312 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 370 transitions. Word has length 46 [2025-03-03 09:44:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,312 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 370 transitions. [2025-03-03 09:44:26,312 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-03 09:44:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 370 transitions. [2025-03-03 09:44:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:44:26,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:26,320 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-03 09:44:26,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:26,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1469344579, now seen corresponding path program 1 times [2025-03-03 09:44:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984327908] [2025-03-03 09:44:26,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:26,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:26,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,648 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-03 09:44:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984327908] [2025-03-03 09:44:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984327908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 09:44:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354734615] [2025-03-03 09:44:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:26,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:26,649 INFO L87 Difference]: Start difference. First operand 274 states and 370 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 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-03 09:44:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,723 INFO L93 Difference]: Finished difference Result 293 states and 390 transitions. [2025-03-03 09:44:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 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 47 [2025-03-03 09:44:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,725 INFO L225 Difference]: With dead ends: 293 [2025-03-03 09:44:26,725 INFO L226 Difference]: Without dead ends: 253 [2025-03-03 09:44:26,725 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-03 09:44:26,726 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 724 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:26,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 724 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-03 09:44:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2025-03-03 09:44:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 202 states have (on average 1.301980198019802) internal successors, (263), 206 states have internal predecessors, (263), 29 states have call successors, (29), 13 states have call predecessors, (29), 15 states have return successors, (37), 27 states have call predecessors, (37), 28 states have call successors, (37) [2025-03-03 09:44:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 329 transitions. [2025-03-03 09:44:26,738 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 329 transitions. Word has length 47 [2025-03-03 09:44:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 329 transitions. [2025-03-03 09:44:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 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-03 09:44:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 329 transitions. [2025-03-03 09:44:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:26,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,739 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] [2025-03-03 09:44:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:44:26,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2022623933, now seen corresponding path program 1 times [2025-03-03 09:44:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593461011] [2025-03-03 09:44:26,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:26,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:26,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,891 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-03 09:44:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593461011] [2025-03-03 09:44:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593461011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:26,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764955320] [2025-03-03 09:44:26,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:26,893 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-03 09:44:26,894 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-03 09:44:26,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:26,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:26,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:44:26,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:27,052 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-03 09:44:27,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:27,349 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-03 09:44:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764955320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:27,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:27,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2025-03-03 09:44:27,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318410741] [2025-03-03 09:44:27,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:27,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:44:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:27,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:44:27,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:44:27,352 INFO L87 Difference]: Start difference. First operand 247 states and 329 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 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-03 09:44:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:28,666 INFO L93 Difference]: Finished difference Result 460 states and 648 transitions. [2025-03-03 09:44:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 09:44:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 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 48 [2025-03-03 09:44:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:28,669 INFO L225 Difference]: With dead ends: 460 [2025-03-03 09:44:28,669 INFO L226 Difference]: Without dead ends: 435 [2025-03-03 09:44:28,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 09:44:28,670 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 271 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 3512 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:28,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 3512 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:44:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-03 09:44:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 290. [2025-03-03 09:44:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 242 states have internal predecessors, (302), 35 states have call successors, (35), 12 states have call predecessors, (35), 20 states have return successors, (55), 35 states have call predecessors, (55), 34 states have call successors, (55) [2025-03-03 09:44:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 392 transitions. [2025-03-03 09:44:28,690 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 392 transitions. Word has length 48 [2025-03-03 09:44:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 392 transitions. [2025-03-03 09:44:28,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 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-03 09:44:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 392 transitions. [2025-03-03 09:44:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:44:28,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:28,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:28,698 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-03 09:44:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:28,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -454865683, now seen corresponding path program 1 times [2025-03-03 09:44:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:28,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861689819] [2025-03-03 09:44:28,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:28,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:28,924 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-03 09:44:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861689819] [2025-03-03 09:44:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861689819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134702555] [2025-03-03 09:44:28,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:28,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:28,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:28,926 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-03 09:44:28,927 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-03 09:44:28,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:28,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:28,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:28,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:28,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:44:28,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:44:28,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134702555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-03 09:44:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121424606] [2025-03-03 09:44:28,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:28,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:28,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:28,977 INFO L87 Difference]: Start difference. First operand 290 states and 392 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 09:44:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:29,014 INFO L93 Difference]: Finished difference Result 583 states and 793 transitions. [2025-03-03 09:44:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 47 [2025-03-03 09:44:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:29,016 INFO L225 Difference]: With dead ends: 583 [2025-03-03 09:44:29,016 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 09:44:29,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:29,017 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 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, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:29,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 173 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 09:44:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2025-03-03 09:44:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 244 states have internal predecessors, (304), 35 states have call successors, (35), 12 states have call predecessors, (35), 20 states have return successors, (55), 35 states have call predecessors, (55), 34 states have call successors, (55) [2025-03-03 09:44:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 394 transitions. [2025-03-03 09:44:29,035 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 394 transitions. Word has length 47 [2025-03-03 09:44:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:29,035 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 394 transitions. [2025-03-03 09:44:29,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 09:44:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 394 transitions. [2025-03-03 09:44:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:29,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:29,036 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] [2025-03-03 09:44:29,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:44:29,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:29,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:29,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1865446607, now seen corresponding path program 2 times [2025-03-03 09:44:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203656096] [2025-03-03 09:44:29,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:29,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-03 09:44:29,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:29,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:44:29,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:29,379 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-03 09:44:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203656096] [2025-03-03 09:44:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203656096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895706305] [2025-03-03 09:44:29,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:29,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:29,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:29,382 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-03 09:44:29,383 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-03 09:44:29,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-03 09:44:29,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:29,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:44:29,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:29,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:44:29,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:29,538 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-03 09:44:29,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:29,794 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-03 09:44:29,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895706305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:29,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2025-03-03 09:44:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49594756] [2025-03-03 09:44:29,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:29,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 09:44:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:29,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 09:44:29,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:44:29,796 INFO L87 Difference]: Start difference. First operand 292 states and 394 transitions. Second operand has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 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-03 09:44:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:30,907 INFO L93 Difference]: Finished difference Result 460 states and 655 transitions. [2025-03-03 09:44:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 09:44:30,908 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 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 48 [2025-03-03 09:44:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:30,910 INFO L225 Difference]: With dead ends: 460 [2025-03-03 09:44:30,910 INFO L226 Difference]: Without dead ends: 447 [2025-03-03 09:44:30,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 86 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-03 09:44:30,911 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 260 mSDsluCounter, 3486 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:30,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 3673 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:44:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-03 09:44:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 305. [2025-03-03 09:44:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 244 states have (on average 1.278688524590164) internal successors, (312), 252 states have internal predecessors, (312), 39 states have call successors, (39), 13 states have call predecessors, (39), 21 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-03-03 09:44:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 420 transitions. [2025-03-03 09:44:30,929 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 420 transitions. Word has length 48 [2025-03-03 09:44:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:30,929 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 420 transitions. [2025-03-03 09:44:30,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 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-03 09:44:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 420 transitions. [2025-03-03 09:44:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:30,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:30,930 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, 1, 1] [2025-03-03 09:44:30,936 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-03 09:44:31,135 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,SelfDestructingSolverStorable12 [2025-03-03 09:44:31,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1645148889, now seen corresponding path program 1 times [2025-03-03 09:44:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778638842] [2025-03-03 09:44:31,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:31,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:31,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:31,174 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-03 09:44:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778638842] [2025-03-03 09:44:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778638842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945051209] [2025-03-03 09:44:31,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:31,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:31,177 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-03 09:44:31,178 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-03 09:44:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:31,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:31,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:31,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:31,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:31,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:31,243 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-03 09:44:31,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945051209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:44:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964265305] [2025-03-03 09:44:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:31,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:31,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:31,244 INFO L87 Difference]: Start difference. First operand 305 states and 420 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 09:44:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:31,283 INFO L93 Difference]: Finished difference Result 613 states and 849 transitions. [2025-03-03 09:44:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 48 [2025-03-03 09:44:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:31,285 INFO L225 Difference]: With dead ends: 613 [2025-03-03 09:44:31,285 INFO L226 Difference]: Without dead ends: 311 [2025-03-03 09:44:31,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-03 09:44:31,287 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 178 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-03 09:44:31,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 178 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-03 09:44:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 303. [2025-03-03 09:44:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 242 states have (on average 1.2768595041322315) internal successors, (309), 250 states have internal predecessors, (309), 39 states have call successors, (39), 13 states have call predecessors, (39), 21 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-03-03 09:44:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2025-03-03 09:44:31,300 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 48 [2025-03-03 09:44:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:31,301 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2025-03-03 09:44:31,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 09:44:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2025-03-03 09:44:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:31,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:31,302 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-03 09:44:31,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:31,506 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,SelfDestructingSolverStorable13 [2025-03-03 09:44:31,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1112939666, now seen corresponding path program 1 times [2025-03-03 09:44:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353294019] [2025-03-03 09:44:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:31,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:31,618 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-03 09:44:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:31,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353294019] [2025-03-03 09:44:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353294019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:31,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:31,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 09:44:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63247559] [2025-03-03 09:44:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:31,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:31,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:31,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:31,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:31,619 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-03 09:44:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:31,713 INFO L93 Difference]: Finished difference Result 478 states and 662 transitions. [2025-03-03 09:44:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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 48 [2025-03-03 09:44:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:31,716 INFO L225 Difference]: With dead ends: 478 [2025-03-03 09:44:31,716 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 09:44:31,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-03 09:44:31,717 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 60 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 829 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-03 09:44:31,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 829 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 09:44:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 303. [2025-03-03 09:44:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 242 states have (on average 1.2685950413223142) internal successors, (307), 250 states have internal predecessors, (307), 39 states have call successors, (39), 13 states have call predecessors, (39), 21 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-03-03 09:44:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 415 transitions. [2025-03-03 09:44:31,732 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 415 transitions. Word has length 48 [2025-03-03 09:44:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:31,733 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 415 transitions. [2025-03-03 09:44:31,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-03 09:44:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 415 transitions. [2025-03-03 09:44:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:31,734 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-03 09:44:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:44:31,735 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 865980221, now seen corresponding path program 1 times [2025-03-03 09:44:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735118767] [2025-03-03 09:44:31,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:31,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:31,809 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-03 09:44:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735118767] [2025-03-03 09:44:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735118767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102424184] [2025-03-03 09:44:31,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:31,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:31,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:31,811 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-03 09:44:31,813 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-03 09:44:31,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:31,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:31,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:31,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:31,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:44:31,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:31,876 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-03 09:44:31,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:31,992 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-03 09:44:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102424184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:31,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2025-03-03 09:44:31,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202243151] [2025-03-03 09:44:31,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:31,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:44:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:31,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:44:31,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:31,993 INFO L87 Difference]: Start difference. First operand 303 states and 415 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 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-03 09:44:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:32,152 INFO L93 Difference]: Finished difference Result 441 states and 601 transitions. [2025-03-03 09:44:32,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:44:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 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 48 [2025-03-03 09:44:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:32,154 INFO L225 Difference]: With dead ends: 441 [2025-03-03 09:44:32,154 INFO L226 Difference]: Without dead ends: 367 [2025-03-03 09:44:32,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:44:32,155 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 136 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:32,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1113 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-03 09:44:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 347. [2025-03-03 09:44:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 289 states have internal predecessors, (355), 42 states have call successors, (42), 15 states have call predecessors, (42), 25 states have return successors, (71), 42 states have call predecessors, (71), 41 states have call successors, (71) [2025-03-03 09:44:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 468 transitions. [2025-03-03 09:44:32,169 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 468 transitions. Word has length 48 [2025-03-03 09:44:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:32,169 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 468 transitions. [2025-03-03 09:44:32,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 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-03 09:44:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 468 transitions. [2025-03-03 09:44:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:32,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:32,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-03 09:44:32,176 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-03 09:44:32,374 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,SelfDestructingSolverStorable15 [2025-03-03 09:44:32,374 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:32,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash 669466716, now seen corresponding path program 2 times [2025-03-03 09:44:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:32,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110797642] [2025-03-03 09:44:32,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:32,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-03 09:44:32,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 48 statements. [2025-03-03 09:44:32,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 09:44:32,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:32,507 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-03 09:44:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110797642] [2025-03-03 09:44:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110797642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:32,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:44:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935441236] [2025-03-03 09:44:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:32,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:32,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:32,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:32,508 INFO L87 Difference]: Start difference. First operand 347 states and 468 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:32,578 INFO L93 Difference]: Finished difference Result 353 states and 473 transitions. [2025-03-03 09:44:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:32,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-03 09:44:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:32,579 INFO L225 Difference]: With dead ends: 353 [2025-03-03 09:44:32,579 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 09:44:32,580 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-03 09:44:32,580 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:32,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 501 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 09:44:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-03 09:44:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 292 states have internal predecessors, (358), 42 states have call successors, (42), 16 states have call predecessors, (42), 26 states have return successors, (71), 42 states have call predecessors, (71), 41 states have call successors, (71) [2025-03-03 09:44:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 471 transitions. [2025-03-03 09:44:32,597 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 471 transitions. Word has length 48 [2025-03-03 09:44:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:32,597 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 471 transitions. [2025-03-03 09:44:32,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 471 transitions. [2025-03-03 09:44:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:32,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:32,599 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, 1] [2025-03-03 09:44:32,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:44:32,599 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash -828932043, now seen corresponding path program 1 times [2025-03-03 09:44:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677630927] [2025-03-03 09:44:32,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:32,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:32,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:32,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:32,687 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-03 09:44:32,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677630927] [2025-03-03 09:44:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677630927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201945535] [2025-03-03 09:44:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:32,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:32,691 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-03 09:44:32,691 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-03 09:44:32,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:32,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:32,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 09:44:32,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:32,813 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-03 09:44:32,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:32,987 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-03 09:44:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201945535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:32,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:32,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2025-03-03 09:44:32,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229979637] [2025-03-03 09:44:32,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:44:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:32,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:44:32,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:44:32,988 INFO L87 Difference]: Start difference. First operand 351 states and 471 transitions. Second operand has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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-03 09:44:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:33,339 INFO L93 Difference]: Finished difference Result 449 states and 631 transitions. [2025-03-03 09:44:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:44:33,339 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 50 [2025-03-03 09:44:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:33,341 INFO L225 Difference]: With dead ends: 449 [2025-03-03 09:44:33,341 INFO L226 Difference]: Without dead ends: 411 [2025-03-03 09:44:33,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 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-03 09:44:33,342 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 220 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:33,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1531 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-03 09:44:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 347. [2025-03-03 09:44:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 289 states have internal predecessors, (351), 43 states have call successors, (43), 14 states have call predecessors, (43), 26 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-03 09:44:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 478 transitions. [2025-03-03 09:44:33,361 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 478 transitions. Word has length 50 [2025-03-03 09:44:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:33,362 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 478 transitions. [2025-03-03 09:44:33,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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-03 09:44:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 478 transitions. [2025-03-03 09:44:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:44:33,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:33,362 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, 1, 1] [2025-03-03 09:44:33,369 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-03 09:44:33,563 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,SelfDestructingSolverStorable17 [2025-03-03 09:44:33,563 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1009169865, now seen corresponding path program 1 times [2025-03-03 09:44:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245159080] [2025-03-03 09:44:33,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:33,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:44:33,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:44:33,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:33,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:33,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245159080] [2025-03-03 09:44:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245159080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:33,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525800454] [2025-03-03 09:44:33,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:33,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:33,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:44:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:44:33,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:44:33,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:33,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:33,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 09:44:33,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:33,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525800454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:33,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:33,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2025-03-03 09:44:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402545079] [2025-03-03 09:44:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:44:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:33,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:44:33,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:44:33,819 INFO L87 Difference]: Start difference. First operand 347 states and 478 transitions. Second operand has 15 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:44:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:34,006 INFO L93 Difference]: Finished difference Result 438 states and 598 transitions. [2025-03-03 09:44:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:44:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-03-03 09:44:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:34,008 INFO L225 Difference]: With dead ends: 438 [2025-03-03 09:44:34,008 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 09:44:34,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:44:34,009 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 67 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:34,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1074 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 09:44:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 349. [2025-03-03 09:44:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 278 states have (on average 1.2589928057553956) internal successors, (350), 290 states have internal predecessors, (350), 43 states have call successors, (43), 15 states have call predecessors, (43), 27 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-03 09:44:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 477 transitions. [2025-03-03 09:44:34,045 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 477 transitions. Word has length 51 [2025-03-03 09:44:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:34,046 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 477 transitions. [2025-03-03 09:44:34,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:44:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 477 transitions. [2025-03-03 09:44:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:44:34,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:34,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:34,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:34,251 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1427426417, now seen corresponding path program 1 times [2025-03-03 09:44:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090207755] [2025-03-03 09:44:34,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:34,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:44:34,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:44:34,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:34,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090207755] [2025-03-03 09:44:34,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090207755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 09:44:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955268814] [2025-03-03 09:44:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:44:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:34,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:44:34,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:44:34,361 INFO L87 Difference]: Start difference. First operand 349 states and 477 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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-03 09:44:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:34,507 INFO L93 Difference]: Finished difference Result 496 states and 681 transitions. [2025-03-03 09:44:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:34,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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 54 [2025-03-03 09:44:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:34,509 INFO L225 Difference]: With dead ends: 496 [2025-03-03 09:44:34,509 INFO L226 Difference]: Without dead ends: 377 [2025-03-03 09:44:34,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:44:34,510 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 95 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:34,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1060 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-03 09:44:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 349. [2025-03-03 09:44:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 278 states have (on average 1.2553956834532374) internal successors, (349), 290 states have internal predecessors, (349), 43 states have call successors, (43), 15 states have call predecessors, (43), 27 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-03 09:44:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 476 transitions. [2025-03-03 09:44:34,525 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 476 transitions. Word has length 54 [2025-03-03 09:44:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:34,525 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 476 transitions. [2025-03-03 09:44:34,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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-03 09:44:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 476 transitions. [2025-03-03 09:44:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:44:34,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:34,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:34,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 09:44:34,527 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 712645822, now seen corresponding path program 1 times [2025-03-03 09:44:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838404261] [2025-03-03 09:44:34,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:34,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:44:34,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:44:34,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:34,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:34,626 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-03 09:44:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:34,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838404261] [2025-03-03 09:44:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838404261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:34,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53870456] [2025-03-03 09:44:34,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:34,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:34,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:34,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:34,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:44:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:44:34,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:44:34,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:34,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:34,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:44:34,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:44:34,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:34,813 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-03 09:44:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53870456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:34,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:34,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-03 09:44:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874231960] [2025-03-03 09:44:34,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:34,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:44:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:34,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:44:34,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:34,815 INFO L87 Difference]: Start difference. First operand 349 states and 476 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:44:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:35,003 INFO L93 Difference]: Finished difference Result 582 states and 799 transitions. [2025-03-03 09:44:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:44:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2025-03-03 09:44:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:35,006 INFO L225 Difference]: With dead ends: 582 [2025-03-03 09:44:35,006 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 09:44:35,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:35,007 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 99 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:35,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1273 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 09:44:35,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 349. [2025-03-03 09:44:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 278 states have (on average 1.2482014388489209) internal successors, (347), 290 states have internal predecessors, (347), 43 states have call successors, (43), 15 states have call predecessors, (43), 27 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-03 09:44:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 474 transitions. [2025-03-03 09:44:35,024 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 474 transitions. Word has length 54 [2025-03-03 09:44:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:35,024 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 474 transitions. [2025-03-03 09:44:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:44:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 474 transitions. [2025-03-03 09:44:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:44:35,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:35,025 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, 1] [2025-03-03 09:44:35,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:35,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 09:44:35,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 702857524, now seen corresponding path program 1 times [2025-03-03 09:44:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225180043] [2025-03-03 09:44:35,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:44:35,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:44:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:35,335 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-03 09:44:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225180043] [2025-03-03 09:44:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225180043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285050685] [2025-03-03 09:44:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:35,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:35,338 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:35,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:44:35,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:44:35,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:44:35,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:35,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:35,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:44:35,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:35,402 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-03 09:44:35,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:35,625 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-03 09:44:35,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285050685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:35,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:35,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-03 09:44:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082197700] [2025-03-03 09:44:35,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:35,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:44:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:35,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:44:35,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:44:35,626 INFO L87 Difference]: Start difference. First operand 349 states and 474 transitions. Second operand has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 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-03 09:44:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:36,136 INFO L93 Difference]: Finished difference Result 415 states and 580 transitions. [2025-03-03 09:44:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:44:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 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 55 [2025-03-03 09:44:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:36,138 INFO L225 Difference]: With dead ends: 415 [2025-03-03 09:44:36,138 INFO L226 Difference]: Without dead ends: 383 [2025-03-03 09:44:36,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 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-03 09:44:36,140 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:36,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1817 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:44:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-03 09:44:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 335. [2025-03-03 09:44:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 268 states have (on average 1.257462686567164) internal successors, (337), 279 states have internal predecessors, (337), 41 states have call successors, (41), 13 states have call predecessors, (41), 25 states have return successors, (80), 42 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-03 09:44:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 458 transitions. [2025-03-03 09:44:36,168 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 458 transitions. Word has length 55 [2025-03-03 09:44:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 458 transitions. [2025-03-03 09:44:36,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 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-03 09:44:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 458 transitions. [2025-03-03 09:44:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:44:36,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:36,169 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, 1] [2025-03-03 09:44:36,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:36,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:36,373 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:36,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1065394846, now seen corresponding path program 2 times [2025-03-03 09:44:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471887688] [2025-03-03 09:44:36,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:36,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:44:36,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:44:36,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:44:36,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:44:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471887688] [2025-03-03 09:44:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471887688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665556021] [2025-03-03 09:44:36,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:36,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:36,905 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:36,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:44:36,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:44:36,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:44:36,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:44:36,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:36,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:44:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:37,114 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-03 09:44:37,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:37,669 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-03 09:44:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665556021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:37,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 13] total 41 [2025-03-03 09:44:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645210696] [2025-03-03 09:44:37,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:37,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:44:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:37,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:44:37,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1537, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:44:37,670 INFO L87 Difference]: Start difference. First operand 335 states and 458 transitions. Second operand has 41 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 34 states have internal predecessors, (71), 7 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-03 09:44:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:39,400 INFO L93 Difference]: Finished difference Result 472 states and 706 transitions. [2025-03-03 09:44:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 09:44:39,401 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 34 states have internal predecessors, (71), 7 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 55 [2025-03-03 09:44:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:39,403 INFO L225 Difference]: With dead ends: 472 [2025-03-03 09:44:39,403 INFO L226 Difference]: Without dead ends: 426 [2025-03-03 09:44:39,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=5171, Unknown=0, NotChecked=0, Total=5550 [2025-03-03 09:44:39,405 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 342 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:39,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 3359 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:44:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-03 09:44:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 296. [2025-03-03 09:44:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 249 states have internal predecessors, (300), 35 states have call successors, (35), 11 states have call predecessors, (35), 23 states have return successors, (64), 35 states have call predecessors, (64), 34 states have call successors, (64) [2025-03-03 09:44:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 399 transitions. [2025-03-03 09:44:39,423 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 399 transitions. Word has length 55 [2025-03-03 09:44:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:39,423 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 399 transitions. [2025-03-03 09:44:39,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 34 states have internal predecessors, (71), 7 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-03 09:44:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 399 transitions. [2025-03-03 09:44:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:44:39,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:39,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:39,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:44:39,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:39,629 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -323490970, now seen corresponding path program 1 times [2025-03-03 09:44:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160874111] [2025-03-03 09:44:39,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:39,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:39,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:39,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:39,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:44:39,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:39,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:39,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:39,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:39,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 09:44:39,682 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:44:39,683 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:44:39,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:44:39,686 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:39,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:44:39,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:39 BoogieIcfgContainer [2025-03-03 09:44:39,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:44:39,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:44:39,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:44:39,715 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:44:39,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:21" (3/4) ... [2025-03-03 09:44:39,717 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 09:44:39,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:44:39,718 INFO L158 Benchmark]: Toolchain (without parser) took 18794.95ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 109.9MB in the beginning and 152.3MB in the end (delta: -42.4MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:39,718 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:39,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.27ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 95.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:39,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.55ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:39,719 INFO L158 Benchmark]: Boogie Preprocessor took 23.57ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:39,720 INFO L158 Benchmark]: IcfgBuilder took 329.68ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 71.9MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:44:39,720 INFO L158 Benchmark]: TraceAbstraction took 18197.01ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 71.9MB in the beginning and 152.4MB in the end (delta: -80.6MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. [2025-03-03 09:44:39,720 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 369.1MB. Free memory was 152.4MB in the beginning and 152.3MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:39,721 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.50ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.27ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 95.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.55ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.57ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 329.68ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 71.9MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18197.01ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 71.9MB in the beginning and 152.4MB in the end (delta: -80.6MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 369.1MB. Free memory was 152.4MB in the beginning and 152.3MB in the end (delta: 115.4kB). 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=95, 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=95, eb=127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=95, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=95, \old(m)=16777216, e=95, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=95, \old(m)=16777216, e=95, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=95, \old(m)=16777216, e=95, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=95, \old(m)=16777216, e=95, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=95, \old(m)=16777216, e=95, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=95, \old(m)=16777216, e=95] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=95, \old(m)=16777216] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=95, \old(m)=16777216, __retres4=3741319168] [L80] return (__retres4); VAL [\old(e)=95, \old(m)=16777216, \result=3741319168] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=95, eb=127, ma=16777216] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) 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] [L57] COND TRUE 1 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] [L243] RET, EXPR base2flt(mb, eb) VAL [a=3741319168, ea=95, eb=127, ma=16777216, mb=33554432] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=3741319168, \old(b)=4294967295] [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)=3741319168, \old(b)=4294967295, a=3741319168, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, b=3741319168] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, b=3741319168, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, b=3741319168, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, ea=127, eb=95, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, ea=127, eb=95, 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)=3741319168, \old(b)=4294967295, a=4294967295, ea=127, eb=95, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, delta=32, 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, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2300 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2150 mSDsluCounter, 28694 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26155 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9676 IncrementalHoareTripleChecker+Invalid, 10016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 2539 mSDtfsCounter, 9676 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1526 GetRequests, 1064 SyntacticMatches, 6 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=17, InterpolantAutomatonStates: 347, 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, 23 MinimizatonAttempts, 812 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1813 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2186 ConstructedInterpolants, 0 QuantifiedInterpolants, 4630 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2225 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 47 InterpolantComputations, 14 PerfectInterpolantSequences, 756/895 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-03 09:44:39,737 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-?-798a7b3-m [2025-03-03 09:44:41,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:44:41,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 09:44:41,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:44:41,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:44:41,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:44:41,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:44:41,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:44:41,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:44:41,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:44:41,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:44:41,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:44:41,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:44:41,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:44:41,558 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:44:41,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:44:41,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:44:41,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:44:41,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:44:41,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:44:41,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:44:41,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:44:41,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:44:41,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:44:41,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:41,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:44:41,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:44:41,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:44:41,562 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-03 09:44:41,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:44:41,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:44:41,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:44:41,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:44:41,770 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:44:41,771 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-03 09:44:42,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523dc5b3/06c4ea66da9944fdaf860b6e950eeb62/FLAG4032430b7 [2025-03-03 09:44:43,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:44:43,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-03-03 09:44:43,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523dc5b3/06c4ea66da9944fdaf860b6e950eeb62/FLAG4032430b7 [2025-03-03 09:44:43,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523dc5b3/06c4ea66da9944fdaf860b6e950eeb62 [2025-03-03 09:44:43,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:44:43,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:44:43,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:43,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:44:43,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:44:43,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391dbdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43, skipping insertion in model container [2025-03-03 09:44:43,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:44:43,523 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-03 09:44:43,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:43,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:44:43,578 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-03 09:44:43,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:43,605 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:44:43,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43 WrapperNode [2025-03-03 09:44:43,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:43,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:43,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:44:43,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:44:43,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,625 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-03-03 09:44:43,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:43,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:44:43,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:44:43,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:44:43,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,642 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-03 09:44:43,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:44:43,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:44:43,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:44:43,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:44:43,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (1/1) ... [2025-03-03 09:44:43,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:43,674 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-03 09:44:43,675 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-03 09:44:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:44:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 09:44:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-03 09:44:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-03 09:44:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:44:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:44:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-03 09:44:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-03 09:44:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 09:44:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 09:44:43,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:44:43,746 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:44:43,952 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 09:44:43,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:44:43,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:44:43,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:44:43,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:43 BoogieIcfgContainer [2025-03-03 09:44:43,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:44:43,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:44:43,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:44:43,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:44:43,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:43" (1/3) ... [2025-03-03 09:44:43,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7864de6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:43, skipping insertion in model container [2025-03-03 09:44:43,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:43" (2/3) ... [2025-03-03 09:44:43,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7864de6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:43, skipping insertion in model container [2025-03-03 09:44:43,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:43" (3/3) ... [2025-03-03 09:44:43,972 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-03-03 09:44:43,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:44:43,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 54 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:44:44,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:44:44,025 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;@29145740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:44:44,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:44:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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-03 09:44:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:44:44,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:44,034 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-03 09:44:44,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:44,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash -66817531, now seen corresponding path program 1 times [2025-03-03 09:44:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826680244] [2025-03-03 09:44:44,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:44,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:44,048 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-03 09:44:44,049 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-03 09:44:44,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:44:44,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:44:44,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:44,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:44,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:44,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:44,241 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-03 09:44:44,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:44,299 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-03 09:44:44,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:44,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826680244] [2025-03-03 09:44:44,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826680244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:44,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:44,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-03 09:44:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815555488] [2025-03-03 09:44:44,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:44,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:44,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:44,323 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 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-03 09:44:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:44,455 INFO L93 Difference]: Finished difference Result 128 states and 193 transitions. [2025-03-03 09:44:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:44,458 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-03 09:44:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:44,465 INFO L225 Difference]: With dead ends: 128 [2025-03-03 09:44:44,466 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 09:44:44,468 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-03 09:44:44,471 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 510 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-03 09:44:44,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 510 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 09:44:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2025-03-03 09:44:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.326086956521739) internal successors, (61), 48 states have internal predecessors, (61), 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-03 09:44:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-03 09:44:44,506 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 31 [2025-03-03 09:44:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:44,507 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-03 09:44:44,507 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-03 09:44:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-03 09:44:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:44:44,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:44,508 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] [2025-03-03 09:44:44,515 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-03 09:44:44,709 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-03 09:44:44,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1493827477, now seen corresponding path program 1 times [2025-03-03 09:44:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521398527] [2025-03-03 09:44:44,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:44,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:44,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:44,712 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-03 09:44:44,713 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-03 09:44:44,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:44:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:44:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:44,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:44:44,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:44,891 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-03 09:44:44,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:45,019 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-03 09:44:45,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:45,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521398527] [2025-03-03 09:44:45,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521398527] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:45,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:45,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-03-03 09:44:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609847088] [2025-03-03 09:44:45,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:45,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:45,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:45,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:45,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:45,021 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:45,112 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2025-03-03 09:44:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-03 09:44:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:45,113 INFO L225 Difference]: With dead ends: 127 [2025-03-03 09:44:45,113 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 09:44:45,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 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-03 09:44:45,114 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 507 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-03 09:44:45,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 507 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 09:44:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2025-03-03 09:44:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.296875) internal successors, (83), 66 states have internal predecessors, (83), 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-03 09:44:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2025-03-03 09:44:45,128 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 35 [2025-03-03 09:44:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:45,128 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2025-03-03 09:44:45,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2025-03-03 09:44:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:44:45,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:45,129 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] [2025-03-03 09:44:45,135 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-03 09:44:45,332 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-03 09:44:45,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1465198326, now seen corresponding path program 1 times [2025-03-03 09:44:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:45,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246838487] [2025-03-03 09:44:45,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:45,337 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-03 09:44:45,338 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-03 09:44:45,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:44:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:44:45,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:45,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:45,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:44:45,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:45,420 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-03 09:44:45,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:45,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246838487] [2025-03-03 09:44:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246838487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:45,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:44:45,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701401609] [2025-03-03 09:44:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:45,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:45,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:45,422 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:45,482 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2025-03-03 09:44:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-03 09:44:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:45,484 INFO L225 Difference]: With dead ends: 126 [2025-03-03 09:44:45,484 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 09:44:45,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 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-03 09:44:45,485 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 426 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-03 09:44:45,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 426 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 09:44:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-03-03 09:44:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 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-03 09:44:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-03-03 09:44:45,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2025-03-03 09:44:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:45,496 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-03-03 09:44:45,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) 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), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-03-03 09:44:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:45,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:45,497 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] [2025-03-03 09:44:45,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:45,698 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-03 09:44:45,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash -648171360, now seen corresponding path program 1 times [2025-03-03 09:44:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794869313] [2025-03-03 09:44:45,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:45,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:45,701 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-03 09:44:45,702 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-03 09:44:45,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:45,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:45,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:45,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:45,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:45,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:45,786 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-03 09:44:45,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:45,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794869313] [2025-03-03 09:44:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794869313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:45,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 09:44:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382979483] [2025-03-03 09:44:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:45,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:45,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:45,787 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 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-03 09:44:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:45,859 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2025-03-03 09:44:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 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 39 [2025-03-03 09:44:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:45,860 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:44:45,860 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 09:44:45,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:45,861 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:45,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 509 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 09:44:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2025-03-03 09:44:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-03 09:44:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2025-03-03 09:44:45,866 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 39 [2025-03-03 09:44:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:45,866 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2025-03-03 09:44:45,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 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-03 09:44:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2025-03-03 09:44:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:45,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:45,867 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] [2025-03-03 09:44:45,873 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-03 09:44:46,067 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-03 09:44:46,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:46,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 80104005, now seen corresponding path program 2 times [2025-03-03 09:44:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694063985] [2025-03-03 09:44:46,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:46,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:46,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:46,070 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-03 09:44:46,071 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-03 09:44:46,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:44:46,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 39 statements. [2025-03-03 09:44:46,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 09:44:46,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:46,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:44:46,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:46,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:46,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694063985] [2025-03-03 09:44:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694063985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 09:44:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963429437] [2025-03-03 09:44:46,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:44:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:46,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:44:46,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:46,248 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-03 09:44:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:46,455 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2025-03-03 09:44:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 39 [2025-03-03 09:44:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:46,457 INFO L225 Difference]: With dead ends: 154 [2025-03-03 09:44:46,457 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 09:44:46,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 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-03 09:44:46,458 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 38 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:46,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1000 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 09:44:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-03-03 09:44:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 85 states have internal predecessors, (103), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (25), 17 states have call predecessors, (25), 17 states have call successors, (25) [2025-03-03 09:44:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2025-03-03 09:44:46,473 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 39 [2025-03-03 09:44:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2025-03-03 09:44:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-03 09:44:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2025-03-03 09:44:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:46,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:46,476 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] [2025-03-03 09:44:46,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:44:46,677 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-03 09:44:46,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:46,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash -906182825, now seen corresponding path program 1 times [2025-03-03 09:44:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23185342] [2025-03-03 09:44:46,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:46,679 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-03 09:44:46,680 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-03 09:44:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:46,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:46,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:46,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:46,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:44:46,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:46,774 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-03 09:44:46,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:46,806 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-03 09:44:46,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23185342] [2025-03-03 09:44:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23185342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:46,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-03 09:44:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934587756] [2025-03-03 09:44:46,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:46,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:46,808 INFO L87 Difference]: Start difference. First operand 112 states and 146 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 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-03 09:44:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:46,883 INFO L93 Difference]: Finished difference Result 216 states and 288 transitions. [2025-03-03 09:44:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:46,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 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 39 [2025-03-03 09:44:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:46,885 INFO L225 Difference]: With dead ends: 216 [2025-03-03 09:44:46,885 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 09:44:46,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 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-03 09:44:46,885 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:46,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 625 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 09:44:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2025-03-03 09:44:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 110 states have internal predecessors, (135), 27 states have call successors, (27), 11 states have call predecessors, (27), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2025-03-03 09:44:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2025-03-03 09:44:46,917 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 39 [2025-03-03 09:44:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2025-03-03 09:44:46,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 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-03 09:44:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2025-03-03 09:44:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:46,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:46,919 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] [2025-03-03 09:44:46,926 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-03 09:44:47,119 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 [2025-03-03 09:44:47,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:47,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash -877553674, now seen corresponding path program 1 times [2025-03-03 09:44:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:47,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589640434] [2025-03-03 09:44:47,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:47,123 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-03 09:44:47,123 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-03 09:44:47,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:47,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:47,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:47,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:47,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:44:47,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:47,283 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-03 09:44:47,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:47,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589640434] [2025-03-03 09:44:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589640434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [713063834] [2025-03-03 09:44:47,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 09:44:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 09:44:47,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 09:44:47,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-03 09:44:47,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:47,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:47,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:47,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:47,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:44:47,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:47,595 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-03 09:44:47,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [713063834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:47,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2025-03-03 09:44:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958910035] [2025-03-03 09:44:47,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:47,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:47,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:47,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:44:47,628 INFO L87 Difference]: Start difference. First operand 148 states and 198 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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-03 09:44:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:47,788 INFO L93 Difference]: Finished difference Result 181 states and 233 transitions. [2025-03-03 09:44:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:44:47,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 39 [2025-03-03 09:44:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:47,794 INFO L225 Difference]: With dead ends: 181 [2025-03-03 09:44:47,794 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 09:44:47,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:44:47,795 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:47,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 888 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 09:44:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 156. [2025-03-03 09:44:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 113 states have (on average 1.247787610619469) internal successors, (141), 116 states have internal predecessors, (141), 27 states have call successors, (27), 13 states have call predecessors, (27), 15 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2025-03-03 09:44:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 204 transitions. [2025-03-03 09:44:47,815 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 204 transitions. Word has length 39 [2025-03-03 09:44:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:47,816 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 204 transitions. [2025-03-03 09:44:47,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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-03 09:44:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 204 transitions. [2025-03-03 09:44:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:47,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:47,817 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] [2025-03-03 09:44:47,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-03 09:44:48,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:44:48,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:48,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2112304379, now seen corresponding path program 1 times [2025-03-03 09:44:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:48,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292879454] [2025-03-03 09:44:48,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:48,220 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-03 09:44:48,221 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-03 09:44:48,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:48,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:48,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:48,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:48,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:48,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:44:48,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:48,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292879454] [2025-03-03 09:44:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292879454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478432844] [2025-03-03 09:44:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:48,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:48,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:48,321 INFO L87 Difference]: Start difference. First operand 156 states and 204 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:44:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:48,389 INFO L93 Difference]: Finished difference Result 173 states and 222 transitions. [2025-03-03 09:44:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 39 [2025-03-03 09:44:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:48,391 INFO L225 Difference]: With dead ends: 173 [2025-03-03 09:44:48,391 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 09:44:48,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-03 09:44:48,391 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:48,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 313 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 09:44:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-03-03 09:44:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (37), 26 states have call predecessors, (37), 27 states have call successors, (37) [2025-03-03 09:44:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2025-03-03 09:44:48,402 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 39 [2025-03-03 09:44:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:48,402 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2025-03-03 09:44:48,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:44:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2025-03-03 09:44:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:44:48,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:48,403 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] [2025-03-03 09:44:48,409 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-03 09:44:48,607 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-03 09:44:48,607 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2083675228, now seen corresponding path program 1 times [2025-03-03 09:44:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561268471] [2025-03-03 09:44:48,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:48,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:48,609 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-03 09:44:48,610 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-03 09:44:48,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:44:48,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:44:48,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:48,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:48,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:44:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:44:48,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:48,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561268471] [2025-03-03 09:44:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561268471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:48,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:48,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744860643] [2025-03-03 09:44:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:48,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:48,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:48,706 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:44:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:48,763 INFO L93 Difference]: Finished difference Result 168 states and 216 transitions. [2025-03-03 09:44:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 39 [2025-03-03 09:44:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:48,765 INFO L225 Difference]: With dead ends: 168 [2025-03-03 09:44:48,765 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 09:44:48,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-03 09:44:48,765 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:48,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 09:44:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2025-03-03 09:44:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 119 states have internal predecessors, (144), 27 states have call successors, (27), 14 states have call predecessors, (27), 16 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2025-03-03 09:44:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2025-03-03 09:44:48,777 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 39 [2025-03-03 09:44:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:48,777 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2025-03-03 09:44:48,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 09:44:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2025-03-03 09:44:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:48,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:48,778 INFO L218 NwaCegarLoop]: trace histogram [3, 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-03 09:44:48,784 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-03 09:44:48,978 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-03 09:44:48,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:48,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash 637158436, now seen corresponding path program 1 times [2025-03-03 09:44:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272153191] [2025-03-03 09:44:48,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:48,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:48,981 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-03 09:44:48,982 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-03 09:44:49,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:49,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:44:49,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:49,062 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-03 09:44:49,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:49,114 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-03 09:44:49,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272153191] [2025-03-03 09:44:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272153191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:49,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2025-03-03 09:44:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146506631] [2025-03-03 09:44:49,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:49,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:49,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:49,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:49,115 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:44:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:49,177 INFO L93 Difference]: Finished difference Result 197 states and 254 transitions. [2025-03-03 09:44:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-03 09:44:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:49,179 INFO L225 Difference]: With dead ends: 197 [2025-03-03 09:44:49,179 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 09:44:49,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 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-03 09:44:49,180 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:49,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 473 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 09:44:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2025-03-03 09:44:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 125 states have (on average 1.232) internal successors, (154), 130 states have internal predecessors, (154), 30 states have call successors, (30), 14 states have call predecessors, (30), 18 states have return successors, (42), 29 states have call predecessors, (42), 29 states have call successors, (42) [2025-03-03 09:44:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 226 transitions. [2025-03-03 09:44:49,192 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 226 transitions. Word has length 44 [2025-03-03 09:44:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:49,192 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 226 transitions. [2025-03-03 09:44:49,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:44:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 226 transitions. [2025-03-03 09:44:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:49,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:49,193 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-03 09:44:49,202 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-03 09:44:49,394 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-03 09:44:49,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1159792923, now seen corresponding path program 1 times [2025-03-03 09:44:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24245448] [2025-03-03 09:44:49,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:49,396 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:49,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:44:49,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:49,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:49,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:49,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:49,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:44:49,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:44:49,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:49,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24245448] [2025-03-03 09:44:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24245448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:49,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:49,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 09:44:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122875603] [2025-03-03 09:44:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:49,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:49,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:49,500 INFO L87 Difference]: Start difference. First operand 174 states and 226 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:44:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:49,644 INFO L93 Difference]: Finished difference Result 229 states and 298 transitions. [2025-03-03 09:44:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:44:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-03 09:44:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:49,646 INFO L225 Difference]: With dead ends: 229 [2025-03-03 09:44:49,646 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 09:44:49,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:44:49,646 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:49,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 659 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 09:44:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 176. [2025-03-03 09:44:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 131 states have internal predecessors, (156), 30 states have call successors, (30), 14 states have call predecessors, (30), 18 states have return successors, (42), 30 states have call predecessors, (42), 29 states have call successors, (42) [2025-03-03 09:44:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 228 transitions. [2025-03-03 09:44:49,659 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 228 transitions. Word has length 44 [2025-03-03 09:44:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:49,659 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 228 transitions. [2025-03-03 09:44:49,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:44:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 228 transitions. [2025-03-03 09:44:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:44:49,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:49,660 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] [2025-03-03 09:44:49,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:49,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:49,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1667542572, now seen corresponding path program 1 times [2025-03-03 09:44:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097191148] [2025-03-03 09:44:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:49,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:49,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:49,866 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:49,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:44:49,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 09:44:49,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:44:49,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:49,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:44:49,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:50,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:50,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097191148] [2025-03-03 09:44:50,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097191148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:50,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:50,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2025-03-03 09:44:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511872965] [2025-03-03 09:44:50,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:50,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 09:44:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:50,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 09:44:50,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:44:50,619 INFO L87 Difference]: Start difference. First operand 176 states and 228 transitions. Second operand has 27 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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-03 09:44:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:51,463 INFO L93 Difference]: Finished difference Result 294 states and 384 transitions. [2025-03-03 09:44:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:44:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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 45 [2025-03-03 09:44:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:51,466 INFO L225 Difference]: With dead ends: 294 [2025-03-03 09:44:51,466 INFO L226 Difference]: Without dead ends: 263 [2025-03-03 09:44:51,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:44:51,467 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 56 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:51,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 2152 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:44:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-03 09:44:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2025-03-03 09:44:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 177 states have internal predecessors, (209), 44 states have call successors, (44), 19 states have call predecessors, (44), 24 states have return successors, (57), 42 states have call predecessors, (57), 43 states have call successors, (57) [2025-03-03 09:44:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2025-03-03 09:44:51,491 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 45 [2025-03-03 09:44:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:51,491 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2025-03-03 09:44:51,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 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-03 09:44:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2025-03-03 09:44:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:44:51,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:51,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:51,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:44:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:51,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 311832934, now seen corresponding path program 1 times [2025-03-03 09:44:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704838218] [2025-03-03 09:44:51,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:51,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:51,699 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:51,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:44:51,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 09:44:51,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:44:51,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:51,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:51,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:44:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 09:44:51,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:44:51,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:51,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:51,768 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-03 09:44:51,768 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:44:51,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:44:51,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:44:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:51,973 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:51,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:44:51,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:51 BoogieIcfgContainer [2025-03-03 09:44:51,988 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:44:51,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:44:51,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:44:51,989 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:44:51,989 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:43" (3/4) ... [2025-03-03 09:44:51,990 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 09:44:52,021 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 25. [2025-03-03 09:44:52,062 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:44:52,062 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:44:52,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:44:52,062 INFO L158 Benchmark]: Toolchain (without parser) took 8641.99ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 90.8MB in the beginning and 132.0MB in the end (delta: -41.2MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.99ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 77.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.63ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: Boogie Preprocessor took 24.43ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: IcfgBuilder took 312.42ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 58.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: TraceAbstraction took 8023.60ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 57.5MB in the beginning and 140.1MB in the end (delta: -82.6MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-03-03 09:44:52,063 INFO L158 Benchmark]: Witness Printer took 73.36ms. Allocated memory is still 234.9MB. Free memory was 139.0MB in the beginning and 132.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:52,065 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.80ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.99ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 77.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.63ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 75.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.43ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 74.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.42ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 58.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8023.60ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 57.5MB in the beginning and 140.1MB in the end (delta: -82.6MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 73.36ms. Allocated memory is still 234.9MB. Free memory was 139.0MB in the beginning and 132.0MB in the end (delta: 7.0MB). 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] [L57] COND TRUE 1 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)=-32, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-32, \old(m)=16777216, e=-32, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-32, \old(m)=16777216, e=-32, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-32, \old(m)=16777216, e=-32, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-32, \old(m)=16777216, e=-32, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-32, \old(m)=16777216, e=-32, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-32, \old(m)=16777216, __retres4=1610612736] [L80] return (__retres4); VAL [\old(e)=-32, \old(m)=16777216, \result=1610612736] [L243] RET, EXPR base2flt(mb, eb) VAL [a=-1, ea=127, eb=-32, ma=67108864, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-1, \old(b)=1610612736] [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)=1610612736, a=-1, b=1610612736] [L94] COND FALSE !(a < b) VAL [\old(a)=-1, \old(b)=1610612736, a=-1, b=1610612736] [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)=1610612736, a=-1, ea=127, eb=-32, 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)=1610612736, a=-1, ea=127, eb=-32, ma=33554431, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-1, \old(b)=1610612736, a=-1, delta=159, 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, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 8370 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7421 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1686 IncrementalHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 949 mSDtfsCounter, 1686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 588 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=12, InterpolantAutomatonStates: 124, 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, 12 MinimizatonAttempts, 189 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 552 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 683 ConstructedInterpolants, 8 QuantifiedInterpolants, 1562 SizeOfPredicates, 27 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 298/327 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-03 09:44:52,077 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