./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.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_codestructure_dependencies_file-66.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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:58:25,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:58:25,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:58:25,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:58:25,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:58:25,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:58:25,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:58:25,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:58:25,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:58:25,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:58:25,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:58:25,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:58:25,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:58:25,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:58:25,814 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:58:25,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:58:25,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:58:25,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:58:25,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:58:25,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:58:25,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:25,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:58:25,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:58:25,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:58:25,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:58:25,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:58:25,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:58:25,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:58:25,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:58:25,817 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2025-03-16 22:58:26,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:58:26,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:58:26,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:58:26,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:58:26,063 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:58:26,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2025-03-16 22:58:27,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20872dea4/7ce2e72619354358b0520267678cb21f/FLAGef78dbc94 [2025-03-16 22:58:27,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:58:27,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2025-03-16 22:58:27,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20872dea4/7ce2e72619354358b0520267678cb21f/FLAGef78dbc94 [2025-03-16 22:58:27,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20872dea4/7ce2e72619354358b0520267678cb21f [2025-03-16 22:58:27,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:58:27,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:58:27,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:27,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:58:27,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:58:27,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27, skipping insertion in model container [2025-03-16 22:58:27,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:58:27,648 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_codestructure_dependencies_file-66.i[919,932] [2025-03-16 22:58:27,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:27,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:58:27,719 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_codestructure_dependencies_file-66.i[919,932] [2025-03-16 22:58:27,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:58:27,760 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:58:27,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27 WrapperNode [2025-03-16 22:58:27,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:58:27,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:27,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:58:27,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:58:27,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,802 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-16 22:58:27,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:58:27,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:58:27,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:58:27,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:58:27,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,825 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:58:27,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:58:27,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:58:27,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:58:27,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:58:27,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (1/1) ... [2025-03-16 22:58:27,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:58:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:27,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:58:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:58:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:58:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:58:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:58:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:58:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:58:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:58:27,938 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:58:27,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:58:28,208 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:58:28,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:58:28,219 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:58:28,220 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:58:28,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:28 BoogieIcfgContainer [2025-03-16 22:58:28,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:58:28,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:58:28,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:58:28,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:58:28,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:58:27" (1/3) ... [2025-03-16 22:58:28,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63121459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:28, skipping insertion in model container [2025-03-16 22:58:28,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:58:27" (2/3) ... [2025-03-16 22:58:28,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63121459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:58:28, skipping insertion in model container [2025-03-16 22:58:28,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:58:28" (3/3) ... [2025-03-16 22:58:28,228 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2025-03-16 22:58:28,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:58:28,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-66.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:58:28,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:58:28,297 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;@7ce8e3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:58:28,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:58:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 22:58:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:28,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:28,311 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:28,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:28,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1711010750, now seen corresponding path program 1 times [2025-03-16 22:58:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652213142] [2025-03-16 22:58:28,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:28,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 22:58:28,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:28,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652213142] [2025-03-16 22:58:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652213142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:58:28,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729287909] [2025-03-16 22:58:28,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:28,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:58:28,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:58:28,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:28,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:28,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:28,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:28,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:58:28,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 22:58:28,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:58:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729287909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:58:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:58:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173328360] [2025-03-16 22:58:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:28,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:58:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:28,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:58:28,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:58:28,719 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 22:58:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:28,740 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2025-03-16 22:58:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:58:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2025-03-16 22:58:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:28,746 INFO L225 Difference]: With dead ends: 101 [2025-03-16 22:58:28,746 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 22:58:28,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-16 22:58:28,751 INFO L435 NwaCegarLoop]: 79 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, 79 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-16 22:58:28,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 22:58:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 22:58:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 22:58:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2025-03-16 22:58:28,778 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 112 [2025-03-16 22:58:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:28,779 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2025-03-16 22:58:28,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 22:58:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2025-03-16 22:58:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:28,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:28,783 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:28,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:58:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 22:58:28,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash -108805026, now seen corresponding path program 1 times [2025-03-16 22:58:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752946461] [2025-03-16 22:58:28,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:29,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:29,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:29,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:29,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752946461] [2025-03-16 22:58:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752946461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:29,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:58:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403833643] [2025-03-16 22:58:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:58:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:29,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:58:29,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:58:29,181 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:29,236 INFO L93 Difference]: Finished difference Result 147 states and 233 transitions. [2025-03-16 22:58:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:58:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2025-03-16 22:58:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:29,238 INFO L225 Difference]: With dead ends: 147 [2025-03-16 22:58:29,238 INFO L226 Difference]: Without dead ends: 98 [2025-03-16 22:58:29,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:58:29,239 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:29,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-16 22:58:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-16 22:58:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 22:58:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2025-03-16 22:58:29,254 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 112 [2025-03-16 22:58:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:29,255 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2025-03-16 22:58:29,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2025-03-16 22:58:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:29,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:29,259 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:29,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:58:29,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -137434177, now seen corresponding path program 1 times [2025-03-16 22:58:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416137704] [2025-03-16 22:58:29,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:29,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:29,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:29,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:29,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416137704] [2025-03-16 22:58:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416137704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:46,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:46,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 22:58:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871039661] [2025-03-16 22:58:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:58:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:46,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:58:46,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:58:46,561 INFO L87 Difference]: Start difference. First operand 96 states and 150 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:47,136 INFO L93 Difference]: Finished difference Result 213 states and 315 transitions. [2025-03-16 22:58:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 22:58:47,136 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2025-03-16 22:58:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:47,138 INFO L225 Difference]: With dead ends: 213 [2025-03-16 22:58:47,138 INFO L226 Difference]: Without dead ends: 211 [2025-03-16 22:58:47,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:58:47,139 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 111 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:47,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 289 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:58:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-16 22:58:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 150. [2025-03-16 22:58:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 103 states have internal predecessors, (144), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:58:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2025-03-16 22:58:47,160 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 112 [2025-03-16 22:58:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:47,161 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2025-03-16 22:58:47,161 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2025-03-16 22:58:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:47,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:47,162 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:47,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:58:47,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:47,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1916259489, now seen corresponding path program 1 times [2025-03-16 22:58:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366642007] [2025-03-16 22:58:47,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:47,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:47,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:47,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366642007] [2025-03-16 22:58:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366642007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:58:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757063559] [2025-03-16 22:58:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:47,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:58:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:47,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:58:47,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:58:47,237 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:47,355 INFO L93 Difference]: Finished difference Result 502 states and 767 transitions. [2025-03-16 22:58:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:58:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2025-03-16 22:58:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:47,359 INFO L225 Difference]: With dead ends: 502 [2025-03-16 22:58:47,359 INFO L226 Difference]: Without dead ends: 353 [2025-03-16 22:58:47,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:58:47,360 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:47,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 205 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:58:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-16 22:58:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 278. [2025-03-16 22:58:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 181 states have (on average 1.430939226519337) internal successors, (259), 185 states have internal predecessors, (259), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 22:58:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 435 transitions. [2025-03-16 22:58:47,391 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 435 transitions. Word has length 112 [2025-03-16 22:58:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 435 transitions. [2025-03-16 22:58:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 435 transitions. [2025-03-16 22:58:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:47,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:47,393 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:47,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:58:47,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1944888640, now seen corresponding path program 1 times [2025-03-16 22:58:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-03-16 22:58:47,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:47,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:47,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:47,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:47,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:47,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-03-16 22:58:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45589607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:58:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630329317] [2025-03-16 22:58:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:47,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:58:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:47,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:58:47,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:58:47,441 INFO L87 Difference]: Start difference. First operand 278 states and 435 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:47,485 INFO L93 Difference]: Finished difference Result 545 states and 852 transitions. [2025-03-16 22:58:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:58:47,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2025-03-16 22:58:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:47,490 INFO L225 Difference]: With dead ends: 545 [2025-03-16 22:58:47,490 INFO L226 Difference]: Without dead ends: 268 [2025-03-16 22:58:47,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:58:47,491 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 69 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:47,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:58:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-16 22:58:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2025-03-16 22:58:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 172 states have (on average 1.313953488372093) internal successors, (226), 175 states have internal predecessors, (226), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-16 22:58:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2025-03-16 22:58:47,521 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 112 [2025-03-16 22:58:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:47,522 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2025-03-16 22:58:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2025-03-16 22:58:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:47,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:47,523 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:58:47,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1028755808, now seen corresponding path program 1 times [2025-03-16 22:58:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763566007] [2025-03-16 22:58:47,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:47,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:47,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:47,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:47,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763566007] [2025-03-16 22:58:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763566007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:58:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663298776] [2025-03-16 22:58:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:49,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:58:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:58:49,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:58:49,077 INFO L87 Difference]: Start difference. First operand 265 states and 394 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:49,576 INFO L93 Difference]: Finished difference Result 478 states and 655 transitions. [2025-03-16 22:58:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:58:49,578 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2025-03-16 22:58:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:49,580 INFO L225 Difference]: With dead ends: 478 [2025-03-16 22:58:49,580 INFO L226 Difference]: Without dead ends: 476 [2025-03-16 22:58:49,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:58:49,581 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 211 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:49,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 288 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:58:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-16 22:58:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 309. [2025-03-16 22:58:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 210 states have (on average 1.319047619047619) internal successors, (277), 215 states have internal predecessors, (277), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 22:58:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2025-03-16 22:58:49,621 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 112 [2025-03-16 22:58:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:49,622 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2025-03-16 22:58:49,623 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2025-03-16 22:58:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:49,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:49,624 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:58:49,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:49,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1028726017, now seen corresponding path program 1 times [2025-03-16 22:58:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988802272] [2025-03-16 22:58:49,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:49,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:49,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:49,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:49,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988802272] [2025-03-16 22:58:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988802272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:58:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823707902] [2025-03-16 22:58:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:58:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:58:51,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:58:51,416 INFO L87 Difference]: Start difference. First operand 309 states and 453 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:51,894 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2025-03-16 22:58:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:58:51,894 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2025-03-16 22:58:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:51,896 INFO L225 Difference]: With dead ends: 476 [2025-03-16 22:58:51,896 INFO L226 Difference]: Without dead ends: 474 [2025-03-16 22:58:51,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:58:51,897 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 194 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:51,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 342 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:58:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-16 22:58:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 309. [2025-03-16 22:58:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 210 states have (on average 1.319047619047619) internal successors, (277), 215 states have internal predecessors, (277), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 22:58:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2025-03-16 22:58:51,926 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 112 [2025-03-16 22:58:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:51,926 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2025-03-16 22:58:51,927 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 22:58:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2025-03-16 22:58:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 22:58:51,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:51,928 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:51,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:58:51,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash -333947682, now seen corresponding path program 1 times [2025-03-16 22:58:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254369768] [2025-03-16 22:58:51,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:51,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 22:58:51,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 22:58:51,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:51,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-16 22:58:52,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:58:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254369768] [2025-03-16 22:58:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254369768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:58:52,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:58:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:58:52,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352171021] [2025-03-16 22:58:52,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:58:52,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:58:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:58:52,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:58:52,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:58:52,108 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-16 22:58:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:58:52,241 INFO L93 Difference]: Finished difference Result 615 states and 887 transitions. [2025-03-16 22:58:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:58:52,243 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 112 [2025-03-16 22:58:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:58:52,245 INFO L225 Difference]: With dead ends: 615 [2025-03-16 22:58:52,245 INFO L226 Difference]: Without dead ends: 347 [2025-03-16 22:58:52,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:58:52,246 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 122 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:58:52,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:58:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-16 22:58:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 340. [2025-03-16 22:58:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 233 states have internal predecessors, (289), 98 states have call successors, (98), 14 states have call predecessors, (98), 14 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 22:58:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 485 transitions. [2025-03-16 22:58:52,284 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 485 transitions. Word has length 112 [2025-03-16 22:58:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:58:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 485 transitions. [2025-03-16 22:58:52,284 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-16 22:58:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 485 transitions. [2025-03-16 22:58:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 22:58:52,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:58:52,285 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:58:52,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:58:52,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:58:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:58:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1313690593, now seen corresponding path program 1 times [2025-03-16 22:58:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:58:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-03-16 22:58:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:58:52,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 22:58:52,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 22:58:52,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:52,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:58:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530769490] [2025-03-16 22:58:52,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:58:52,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:58:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:58:52,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:58:52,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:58:52,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 22:58:52,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 22:58:52,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:58:52,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:58:52,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 22:58:52,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:58:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 419 proven. 93 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-16 22:58:54,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:59:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:59:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-03-16 22:59:26,570 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 22:59:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530769490] [2025-03-16 22:59:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530769490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:59:26,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:59:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-16 22:59:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595634739] [2025-03-16 22:59:26,571 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 22:59:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 22:59:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:59:26,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 22:59:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=452, Unknown=2, NotChecked=0, Total=600 [2025-03-16 22:59:26,572 INFO L87 Difference]: Start difference. First operand 340 states and 485 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 7 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-16 22:59:32,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:37,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:46,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:47,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:49,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 22:59:55,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-16 22:59:59,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-16 23:00:03,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]