./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i -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 39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:56:26,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:56:26,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:56:26,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:56:26,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:56:26,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:56:26,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:56:26,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:56:26,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:56:26,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:56:26,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:56:26,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:56:26,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:56:26,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:56:26,744 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:56:26,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:56:26,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:56:26,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:56:26,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:56:26,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:56:26,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:26,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:56:26,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:56:26,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:56:26,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:56:26,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:56:26,747 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 -> 39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175 [2025-03-17 02:56:27,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:56:27,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:56:27,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:56:27,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:56:27,032 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:56:27,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i [2025-03-17 02:56:28,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fa6afbd/8da93acdb9dd41e88cdbd13f9dcd6533/FLAG8d6eafa76 [2025-03-17 02:56:28,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:56:28,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i [2025-03-17 02:56:28,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fa6afbd/8da93acdb9dd41e88cdbd13f9dcd6533/FLAG8d6eafa76 [2025-03-17 02:56:28,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fa6afbd/8da93acdb9dd41e88cdbd13f9dcd6533 [2025-03-17 02:56:28,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:56:28,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:56:28,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:28,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:56:28,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:56:28,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:28" (1/1) ... [2025-03-17 02:56:28,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44135b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:28, skipping insertion in model container [2025-03-17 02:56:28,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:28" (1/1) ... [2025-03-17 02:56:28,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:56:28,960 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i[915,928] [2025-03-17 02:56:28,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:29,006 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:56:29,013 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i[915,928] [2025-03-17 02:56:29,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:29,043 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:56:29,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29 WrapperNode [2025-03-17 02:56:29,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:29,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:29,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:56:29,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:56:29,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,086 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-17 02:56:29,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:29,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:56:29,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:56:29,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:56:29,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,105 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-17 02:56:29,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:56:29,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:56:29,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:56:29,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:56:29,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (1/1) ... [2025-03-17 02:56:29,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:29,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:29,150 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-17 02:56:29,152 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-17 02:56:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:56:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:56:29,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:56:29,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:56:29,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:56:29,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:56:29,228 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:56:29,230 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:56:29,464 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:56:29,465 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:56:29,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:56:29,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:56:29,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:29 BoogieIcfgContainer [2025-03-17 02:56:29,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:56:29,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:56:29,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:56:29,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:56:29,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:56:28" (1/3) ... [2025-03-17 02:56:29,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252247ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:29, skipping insertion in model container [2025-03-17 02:56:29,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:29" (2/3) ... [2025-03-17 02:56:29,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252247ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:29, skipping insertion in model container [2025-03-17 02:56:29,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:29" (3/3) ... [2025-03-17 02:56:29,483 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-6.i [2025-03-17 02:56:29,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:56:29,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-6.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:56:29,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:56:29,550 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;@7713e932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:56:29,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:56:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 02:56:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:56:29,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:29,566 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:29,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1358972392, now seen corresponding path program 1 times [2025-03-17 02:56:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633548999] [2025-03-17 02:56:29,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:29,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:29,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:56:29,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:56:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 02:56:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633548999] [2025-03-17 02:56:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633548999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:29,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877147536] [2025-03-17 02:56:29,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:29,815 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-17 02:56:29,816 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-17 02:56:29,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:56:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:56:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:29,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:56:29,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 02:56:29,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:56:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877147536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:56:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:56:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035841885] [2025-03-17 02:56:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:56:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:56:30,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:56:30,012 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:30,034 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2025-03-17 02:56:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:56:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 136 [2025-03-17 02:56:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:30,042 INFO L225 Difference]: With dead ends: 105 [2025-03-17 02:56:30,043 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 02:56:30,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:56:30,051 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:30,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 02:56:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 02:56:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 02:56:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2025-03-17 02:56:30,089 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 136 [2025-03-17 02:56:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:30,089 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2025-03-17 02:56:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2025-03-17 02:56:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:56:30,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:30,097 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:30,103 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-17 02:56:30,297 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-17 02:56:30,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:30,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash -916055641, now seen corresponding path program 1 times [2025-03-17 02:56:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:30,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419129427] [2025-03-17 02:56:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:30,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:56:30,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:56:30,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:30,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419129427] [2025-03-17 02:56:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419129427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:30,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:30,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:56:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678318105] [2025-03-17 02:56:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:30,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:56:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:30,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:56:30,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:56:30,756 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:30,901 INFO L93 Difference]: Finished difference Result 103 states and 159 transitions. [2025-03-17 02:56:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2025-03-17 02:56:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:30,903 INFO L225 Difference]: With dead ends: 103 [2025-03-17 02:56:30,903 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 02:56:30,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:56:30,904 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:30,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 76 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:56:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 02:56:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 02:56:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 02:56:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2025-03-17 02:56:30,913 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 136 [2025-03-17 02:56:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:30,915 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2025-03-17 02:56:30,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2025-03-17 02:56:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:56:30,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:30,917 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:56:30,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:30,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash -887426490, now seen corresponding path program 1 times [2025-03-17 02:56:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645674567] [2025-03-17 02:56:30,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:56:30,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:56:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:30,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:31,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645674567] [2025-03-17 02:56:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645674567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975183475] [2025-03-17 02:56:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:31,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:31,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,142 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:31,184 INFO L93 Difference]: Finished difference Result 140 states and 211 transitions. [2025-03-17 02:56:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:31,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2025-03-17 02:56:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:31,185 INFO L225 Difference]: With dead ends: 140 [2025-03-17 02:56:31,186 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 02:56:31,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:31,187 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:31,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 188 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 02:56:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-03-17 02:56:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 02:56:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2025-03-17 02:56:31,212 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 136 [2025-03-17 02:56:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:31,212 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2025-03-17 02:56:31,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2025-03-17 02:56:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:56:31,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:31,214 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:31,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:56:31,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:31,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash 77191, now seen corresponding path program 1 times [2025-03-17 02:56:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:31,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355756421] [2025-03-17 02:56:31,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:56:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:56:31,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:31,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:35,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355756421] [2025-03-17 02:56:35,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355756421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:35,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:35,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:56:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088362325] [2025-03-17 02:56:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:35,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:56:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:35,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:56:35,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:56:35,410 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:38,001 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2025-03-17 02:56:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:56:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2025-03-17 02:56:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:38,005 INFO L225 Difference]: With dead ends: 180 [2025-03-17 02:56:38,005 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 02:56:38,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:56:38,007 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:38,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 247 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:56:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 02:56:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2025-03-17 02:56:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 90 states have (on average 1.2) internal successors, (108), 92 states have internal predecessors, (108), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 02:56:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2025-03-17 02:56:38,040 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 136 [2025-03-17 02:56:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:38,041 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2025-03-17 02:56:38,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2025-03-17 02:56:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:38,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:38,043 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:38,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:56:38,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:38,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:38,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1501147, now seen corresponding path program 1 times [2025-03-17 02:56:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:38,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111120423] [2025-03-17 02:56:38,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:38,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:38,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:38,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:38,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:38,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:38,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111120423] [2025-03-17 02:56:38,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111120423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:38,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:38,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:56:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255665651] [2025-03-17 02:56:38,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:38,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:56:38,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:38,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:56:38,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:56:38,531 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:38,804 INFO L93 Difference]: Finished difference Result 405 states and 613 transitions. [2025-03-17 02:56:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:56:38,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2025-03-17 02:56:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:38,808 INFO L225 Difference]: With dead ends: 405 [2025-03-17 02:56:38,808 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 02:56:38,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:56:38,810 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:38,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 228 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:56:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 02:56:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2025-03-17 02:56:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:56:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 338 transitions. [2025-03-17 02:56:38,858 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 338 transitions. Word has length 137 [2025-03-17 02:56:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:38,860 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 338 transitions. [2025-03-17 02:56:38,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 338 transitions. [2025-03-17 02:56:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:38,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:38,862 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:38,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:56:38,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:38,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1530938, now seen corresponding path program 1 times [2025-03-17 02:56:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:38,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424414323] [2025-03-17 02:56:38,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:38,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:38,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:38,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424414323] [2025-03-17 02:56:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424414323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:56:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995004850] [2025-03-17 02:56:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:45,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:56:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:45,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:56:45,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:56:45,197 INFO L87 Difference]: Start difference. First operand 222 states and 338 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:50,900 INFO L93 Difference]: Finished difference Result 238 states and 354 transitions. [2025-03-17 02:56:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:56:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2025-03-17 02:56:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:50,903 INFO L225 Difference]: With dead ends: 238 [2025-03-17 02:56:50,904 INFO L226 Difference]: Without dead ends: 236 [2025-03-17 02:56:50,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-03-17 02:56:50,906 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:50,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 376 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 02:56:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-17 02:56:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 222. [2025-03-17 02:56:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:56:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 338 transitions. [2025-03-17 02:56:50,942 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 338 transitions. Word has length 137 [2025-03-17 02:56:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:50,942 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 338 transitions. [2025-03-17 02:56:50,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 338 transitions. [2025-03-17 02:56:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:50,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:50,944 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:56:50,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 883555417, now seen corresponding path program 1 times [2025-03-17 02:56:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490138991] [2025-03-17 02:56:50,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:50,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:50,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:50,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:50,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490138991] [2025-03-17 02:56:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490138991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:52,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:56:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811997220] [2025-03-17 02:56:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:52,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:56:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:52,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:56:52,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:56:52,552 INFO L87 Difference]: Start difference. First operand 222 states and 338 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:52,913 INFO L93 Difference]: Finished difference Result 265 states and 391 transitions. [2025-03-17 02:56:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:56:52,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2025-03-17 02:56:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:52,916 INFO L225 Difference]: With dead ends: 265 [2025-03-17 02:56:52,916 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 02:56:52,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:56:52,917 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 56 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 321 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:52,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 321 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:56:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 02:56:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2025-03-17 02:56:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 125 states have (on average 1.216) internal successors, (152), 127 states have internal predecessors, (152), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:56:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2025-03-17 02:56:52,952 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 350 transitions. Word has length 137 [2025-03-17 02:56:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:52,952 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 350 transitions. [2025-03-17 02:56:52,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 350 transitions. [2025-03-17 02:56:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:52,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:52,955 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:52,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:56:52,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:52,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1771059098, now seen corresponding path program 1 times [2025-03-17 02:56:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:52,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430378459] [2025-03-17 02:56:52,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:52,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:52,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:53,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:53,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:53,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430378459] [2025-03-17 02:56:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430378459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:56:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77652201] [2025-03-17 02:56:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:56,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:56:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:56,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:56:56,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:56:56,892 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:58,577 INFO L93 Difference]: Finished difference Result 244 states and 362 transitions. [2025-03-17 02:56:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:56:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2025-03-17 02:56:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:58,581 INFO L225 Difference]: With dead ends: 244 [2025-03-17 02:56:58,581 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 02:56:58,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:56:58,582 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 76 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:58,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 269 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 02:56:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 02:56:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2025-03-17 02:56:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 127 states have (on average 1.2125984251968505) internal successors, (154), 129 states have internal predecessors, (154), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:56:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 352 transitions. [2025-03-17 02:56:58,615 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 352 transitions. Word has length 137 [2025-03-17 02:56:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:58,615 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 352 transitions. [2025-03-17 02:56:58,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 352 transitions. [2025-03-17 02:56:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:58,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:58,617 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:58,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:56:58,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1668601544, now seen corresponding path program 1 times [2025-03-17 02:56:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:58,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984055081] [2025-03-17 02:56:58,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:58,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:58,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:58,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:58,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:59,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984055081] [2025-03-17 02:56:59,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984055081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:59,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:59,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:56:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387284342] [2025-03-17 02:56:59,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:59,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:56:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:59,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:56:59,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:56:59,932 INFO L87 Difference]: Start difference. First operand 232 states and 352 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:00,319 INFO L93 Difference]: Finished difference Result 272 states and 400 transitions. [2025-03-17 02:57:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:57:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2025-03-17 02:57:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:00,321 INFO L225 Difference]: With dead ends: 272 [2025-03-17 02:57:00,321 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 02:57:00,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:57:00,323 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 54 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:00,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 258 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 02:57:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 229. [2025-03-17 02:57:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 124 states have (on average 1.1935483870967742) internal successors, (148), 126 states have internal predecessors, (148), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:57:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2025-03-17 02:57:00,341 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 137 [2025-03-17 02:57:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:00,341 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2025-03-17 02:57:00,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2025-03-17 02:57:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:57:00,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:00,343 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:57:00,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:57:00,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:00,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1619522377, now seen corresponding path program 1 times [2025-03-17 02:57:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342181892] [2025-03-17 02:57:00,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:00,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:57:00,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:57:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:57:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:02,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342181892] [2025-03-17 02:57:02,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342181892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:02,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388100139] [2025-03-17 02:57:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:02,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:02,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:02,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:02,314 INFO L87 Difference]: Start difference. First operand 229 states and 346 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:02,619 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2025-03-17 02:57:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:57:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2025-03-17 02:57:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:02,622 INFO L225 Difference]: With dead ends: 270 [2025-03-17 02:57:02,622 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 02:57:02,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:57:02,622 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 34 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:02,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 285 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 02:57:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2025-03-17 02:57:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 131 states have (on average 1.2213740458015268) internal successors, (160), 133 states have internal predecessors, (160), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:57:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 358 transitions. [2025-03-17 02:57:02,642 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 358 transitions. Word has length 138 [2025-03-17 02:57:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:02,643 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 358 transitions. [2025-03-17 02:57:02,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 358 transitions. [2025-03-17 02:57:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:57:02,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:02,645 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:57:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:57:02,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -932604793, now seen corresponding path program 1 times [2025-03-17 02:57:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927821152] [2025-03-17 02:57:02,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:02,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:02,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:57:02,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:57:02,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:02,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:57:04,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:04,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927821152] [2025-03-17 02:57:04,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927821152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:04,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:04,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:04,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897091657] [2025-03-17 02:57:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:04,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:04,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:04,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:04,231 INFO L87 Difference]: Start difference. First operand 236 states and 358 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:05,218 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2025-03-17 02:57:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:57:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2025-03-17 02:57:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:05,222 INFO L225 Difference]: With dead ends: 252 [2025-03-17 02:57:05,222 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 02:57:05,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:57:05,223 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:05,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 284 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:57:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 02:57:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2025-03-17 02:57:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 131 states have (on average 1.2213740458015268) internal successors, (160), 133 states have internal predecessors, (160), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:57:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 358 transitions. [2025-03-17 02:57:05,246 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 358 transitions. Word has length 138 [2025-03-17 02:57:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:05,246 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 358 transitions. [2025-03-17 02:57:05,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 358 transitions. [2025-03-17 02:57:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:57:05,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:05,247 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:57:05,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:57:05,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -187932086, now seen corresponding path program 1 times [2025-03-17 02:57:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368222372] [2025-03-17 02:57:05,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:57:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:57:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:57:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368222372] [2025-03-17 02:57:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368222372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599348960] [2025-03-17 02:57:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:06,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:06,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:06,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:06,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:06,626 INFO L87 Difference]: Start difference. First operand 236 states and 358 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:06,915 INFO L93 Difference]: Finished difference Result 275 states and 404 transitions. [2025-03-17 02:57:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:57:06,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2025-03-17 02:57:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:06,918 INFO L225 Difference]: With dead ends: 275 [2025-03-17 02:57:06,919 INFO L226 Difference]: Without dead ends: 273 [2025-03-17 02:57:06,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:57:06,919 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 29 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:06,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 321 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-17 02:57:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2025-03-17 02:57:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 132 states have (on average 1.2272727272727273) internal successors, (162), 134 states have internal predecessors, (162), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:57:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 360 transitions. [2025-03-17 02:57:06,954 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 360 transitions. Word has length 138 [2025-03-17 02:57:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:06,954 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 360 transitions. [2025-03-17 02:57:06,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 360 transitions. [2025-03-17 02:57:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:57:06,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:06,956 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:57:06,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:57:06,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash -187902295, now seen corresponding path program 1 times [2025-03-17 02:57:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197108883] [2025-03-17 02:57:06,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:06,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:57:06,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:57:06,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:06,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:57:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197108883] [2025-03-17 02:57:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197108883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:57:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:57:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:57:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64093488] [2025-03-17 02:57:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:57:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:57:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:57:08,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:57:08,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:57:08,316 INFO L87 Difference]: Start difference. First operand 237 states and 360 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:57:08,646 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2025-03-17 02:57:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:57:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2025-03-17 02:57:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:57:08,648 INFO L225 Difference]: With dead ends: 271 [2025-03-17 02:57:08,648 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 02:57:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:57:08,649 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 37 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:57:08,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 267 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:57:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 02:57:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 230. [2025-03-17 02:57:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 125 states have (on average 1.2) internal successors, (150), 127 states have internal predecessors, (150), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 02:57:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 348 transitions. [2025-03-17 02:57:08,671 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 348 transitions. Word has length 138 [2025-03-17 02:57:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:57:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 348 transitions. [2025-03-17 02:57:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:57:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 348 transitions. [2025-03-17 02:57:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 02:57:08,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:57:08,676 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:57:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:57:08,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:57:08,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:57:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1756497705, now seen corresponding path program 1 times [2025-03-17 02:57:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:57:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917920147] [2025-03-17 02:57:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:57:08,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 02:57:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 02:57:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4176 trivial. 0 not checked. [2025-03-17 02:57:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:57:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917920147] [2025-03-17 02:57:12,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917920147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:57:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21502814] [2025-03-17 02:57:12,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:57:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:57:12,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:57:12,228 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-17 02:57:12,230 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-17 02:57:12,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 02:57:12,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 02:57:12,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:57:12,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:57:12,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 02:57:12,370 INFO L279 TraceCheckSpWp]: Computing forward predicates...