./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:48:00,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:48:00,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:48:00,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:48:00,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:48:00,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:48:00,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:48:00,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:48:00,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:48:00,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:48:00,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:48:00,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:48:00,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:48:00,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:48:00,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:48:00,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:48:00,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:48:00,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:48:00,884 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-jdk21/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 -> e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 [2025-02-05 22:48:01,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:48:01,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:48:01,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:48:01,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:48:01,128 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:48:01,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-02-05 22:48:02,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f32d9bb3/596cdc60949f42488ba69048fb450d4a/FLAG83757d393 [2025-02-05 22:48:02,583 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:48:02,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-02-05 22:48:02,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f32d9bb3/596cdc60949f42488ba69048fb450d4a/FLAG83757d393 [2025-02-05 22:48:02,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f32d9bb3/596cdc60949f42488ba69048fb450d4a [2025-02-05 22:48:02,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:48:02,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:48:02,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:48:02,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:48:02,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:48:02,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:02" (1/1) ... [2025-02-05 22:48:02,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:02, skipping insertion in model container [2025-02-05 22:48:02,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:02" (1/1) ... [2025-02-05 22:48:02,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:48:02,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i[919,932] [2025-02-05 22:48:03,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:48:03,062 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:48:03,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i[919,932] [2025-02-05 22:48:03,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:48:03,128 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:48:03,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03 WrapperNode [2025-02-05 22:48:03,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:48:03,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:48:03,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:48:03,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:48:03,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,183 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-02-05 22:48:03,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:48:03,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:48:03,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:48:03,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:48:03,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,224 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-02-05 22:48:03,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:48:03,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:48:03,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:48:03,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:48:03,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (1/1) ... [2025-02-05 22:48:03,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:48:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:48:03,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:48:03,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:48:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:48:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:48:03,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:48:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:48:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:48:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:48:03,358 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:48:03,360 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:48:03,756 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 22:48:03,757 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:48:03,768 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:48:03,770 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:48:03,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:48:03 BoogieIcfgContainer [2025-02-05 22:48:03,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:48:03,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:48:03,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:48:03,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:48:03,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:48:02" (1/3) ... [2025-02-05 22:48:03,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8597edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:48:03, skipping insertion in model container [2025-02-05 22:48:03,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:03" (2/3) ... [2025-02-05 22:48:03,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8597edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:48:03, skipping insertion in model container [2025-02-05 22:48:03,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:48:03" (3/3) ... [2025-02-05 22:48:03,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-02-05 22:48:03,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:48:03,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:48:03,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:48:03,863 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;@3e36c830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:48:03,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:48:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:48:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:48:03,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:03,882 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:48:03,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2073534347, now seen corresponding path program 1 times [2025-02-05 22:48:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373941365] [2025-02-05 22:48:03,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:03,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:48:04,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:48:04,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:04,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 22:48:04,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:04,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373941365] [2025-02-05 22:48:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373941365] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:48:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021584233] [2025-02-05 22:48:04,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:04,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:48:04,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:48:04,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:48:04,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:48:04,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:48:04,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:48:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:04,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:48:04,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:48:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 22:48:04,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:48:04,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021584233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:04,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:48:04,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:48:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775133105] [2025-02-05 22:48:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:48:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:04,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:48:04,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:48:04,460 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:48:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:04,479 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2025-02-05 22:48:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:48:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-02-05 22:48:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:04,484 INFO L225 Difference]: With dead ends: 160 [2025-02-05 22:48:04,484 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 22:48:04,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-02-05 22:48:04,488 INFO L435 NwaCegarLoop]: 126 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, 126 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-02-05 22:48:04,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:48:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 22:48:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-05 22:48:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:48:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2025-02-05 22:48:04,512 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 160 [2025-02-05 22:48:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2025-02-05 22:48:04,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:48:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2025-02-05 22:48:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:48:04,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:04,515 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:48:04,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:48:04,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:48:04,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:04,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2018364115, now seen corresponding path program 1 times [2025-02-05 22:48:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615424816] [2025-02-05 22:48:04,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:48:04,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:48:04,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:04,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:48:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615424816] [2025-02-05 22:48:05,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615424816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:05,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:05,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:48:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27742639] [2025-02-05 22:48:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:05,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:48:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:05,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:48:05,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:48:05,015 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:48:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:05,197 INFO L93 Difference]: Finished difference Result 234 states and 372 transitions. [2025-02-05 22:48:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:48:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-02-05 22:48:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:05,199 INFO L225 Difference]: With dead ends: 234 [2025-02-05 22:48:05,199 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 22:48:05,200 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-02-05 22:48:05,201 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 203 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:05,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 216 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:48:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 22:48:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-02-05 22:48:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 22:48:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2025-02-05 22:48:05,224 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 160 [2025-02-05 22:48:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:05,225 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2025-02-05 22:48:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:48:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2025-02-05 22:48:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:48:05,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:05,227 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:48:05,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:48:05,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash 210909652, now seen corresponding path program 1 times [2025-02-05 22:48:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845280006] [2025-02-05 22:48:05,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:05,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:48:05,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:48:05,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:05,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:48:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845280006] [2025-02-05 22:48:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845280006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:28,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:28,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:48:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079869508] [2025-02-05 22:48:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:28,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:48:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:28,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:48:28,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:48:28,501 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:48:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:30,058 INFO L93 Difference]: Finished difference Result 669 states and 1062 transitions. [2025-02-05 22:48:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:48:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 22:48:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:30,063 INFO L225 Difference]: With dead ends: 669 [2025-02-05 22:48:30,066 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 22:48:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:48:30,067 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 582 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:30,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 515 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:48:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 22:48:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 315. [2025-02-05 22:48:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 254 states have (on average 1.5236220472440944) internal successors, (387), 256 states have internal predecessors, (387), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 22:48:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 499 transitions. [2025-02-05 22:48:30,097 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 499 transitions. Word has length 160 [2025-02-05 22:48:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:30,097 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 499 transitions. [2025-02-05 22:48:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:48:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 499 transitions. [2025-02-05 22:48:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:48:30,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:30,099 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:48:30,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:48:30,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash 339992371, now seen corresponding path program 1 times [2025-02-05 22:48:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:30,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504104365] [2025-02-05 22:48:30,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:30,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:48:30,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:48:30,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:30,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:48:44,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504104365] [2025-02-05 22:48:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504104365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:44,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:44,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 22:48:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860501882] [2025-02-05 22:48:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:44,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:48:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:44,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:48:44,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:48:44,293 INFO L87 Difference]: Start difference. First operand 315 states and 499 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 22:48:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:56,303 INFO L93 Difference]: Finished difference Result 805 states and 1232 transitions. [2025-02-05 22:48:56,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 22:48:56,304 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 160 [2025-02-05 22:48:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:56,307 INFO L225 Difference]: With dead ends: 805 [2025-02-05 22:48:56,308 INFO L226 Difference]: Without dead ends: 493 [2025-02-05 22:48:56,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 22:48:56,309 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 741 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:56,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 654 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 22:48:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-05 22:48:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 335. [2025-02-05 22:48:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 268 states have (on average 1.492537313432836) internal successors, (400), 270 states have internal predecessors, (400), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:48:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 520 transitions. [2025-02-05 22:48:56,342 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 520 transitions. Word has length 160 [2025-02-05 22:48:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:56,343 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 520 transitions. [2025-02-05 22:48:56,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 22:48:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 520 transitions. [2025-02-05 22:48:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:48:56,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:56,345 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:48:56,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:48:56,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:56,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash 721443829, now seen corresponding path program 1 times [2025-02-05 22:48:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:56,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101417227] [2025-02-05 22:48:56,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:56,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:48:56,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:48:56,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:56,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:49:11,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:49:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101417227] [2025-02-05 22:49:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101417227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:49:11,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:49:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:49:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901527201] [2025-02-05 22:49:11,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:49:11,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:49:11,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:49:11,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:49:11,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:49:11,434 INFO L87 Difference]: Start difference. First operand 335 states and 520 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:49:13,125 INFO L93 Difference]: Finished difference Result 475 states and 717 transitions. [2025-02-05 22:49:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:49:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 22:49:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:49:13,131 INFO L225 Difference]: With dead ends: 475 [2025-02-05 22:49:13,131 INFO L226 Difference]: Without dead ends: 473 [2025-02-05 22:49:13,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:49:13,132 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 217 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:49:13,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 776 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:49:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-05 22:49:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 339. [2025-02-05 22:49:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 272 states have (on average 1.4926470588235294) internal successors, (406), 274 states have internal predecessors, (406), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:49:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 526 transitions. [2025-02-05 22:49:13,153 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 526 transitions. Word has length 160 [2025-02-05 22:49:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:49:13,153 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 526 transitions. [2025-02-05 22:49:13,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 526 transitions. [2025-02-05 22:49:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:49:13,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:49:13,155 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:49:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:49:13,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:49:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:49:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash 850526548, now seen corresponding path program 1 times [2025-02-05 22:49:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:49:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985581194] [2025-02-05 22:49:13,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:49:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:49:13,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:49:13,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:49:13,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:49:13,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:49:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:49:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985581194] [2025-02-05 22:49:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985581194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:49:16,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:49:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:49:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168731782] [2025-02-05 22:49:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:49:16,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:49:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:49:16,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:49:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:49:16,768 INFO L87 Difference]: Start difference. First operand 339 states and 526 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:49:19,240 INFO L93 Difference]: Finished difference Result 472 states and 712 transitions. [2025-02-05 22:49:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:49:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 22:49:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:49:19,245 INFO L225 Difference]: With dead ends: 472 [2025-02-05 22:49:19,245 INFO L226 Difference]: Without dead ends: 470 [2025-02-05 22:49:19,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:49:19,248 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 448 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:49:19,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 649 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 22:49:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-05 22:49:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 339. [2025-02-05 22:49:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 272 states have (on average 1.4926470588235294) internal successors, (406), 274 states have internal predecessors, (406), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:49:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 526 transitions. [2025-02-05 22:49:19,283 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 526 transitions. Word has length 160 [2025-02-05 22:49:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:49:19,283 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 526 transitions. [2025-02-05 22:49:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 526 transitions. [2025-02-05 22:49:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:49:19,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:49:19,285 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:49:19,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:49:19,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:49:19,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:49:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash -633562219, now seen corresponding path program 1 times [2025-02-05 22:49:19,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:49:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076253435] [2025-02-05 22:49:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:49:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:49:19,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:49:19,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:49:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:49:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:49:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:49:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076253435] [2025-02-05 22:49:19,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076253435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:49:19,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:49:19,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:49:19,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129035208] [2025-02-05 22:49:19,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:49:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:49:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:49:19,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:49:19,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:49:19,328 INFO L87 Difference]: Start difference. First operand 339 states and 526 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:49:19,388 INFO L93 Difference]: Finished difference Result 869 states and 1339 transitions. [2025-02-05 22:49:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:49:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 22:49:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:49:19,392 INFO L225 Difference]: With dead ends: 869 [2025-02-05 22:49:19,392 INFO L226 Difference]: Without dead ends: 533 [2025-02-05 22:49:19,393 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-02-05 22:49:19,394 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 109 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:49:19,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 330 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:49:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-05 22:49:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 527. [2025-02-05 22:49:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 394 states have (on average 1.383248730964467) internal successors, (545), 398 states have internal predecessors, (545), 120 states have call successors, (120), 12 states have call predecessors, (120), 12 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-05 22:49:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 785 transitions. [2025-02-05 22:49:19,441 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 785 transitions. Word has length 160 [2025-02-05 22:49:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:49:19,441 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 785 transitions. [2025-02-05 22:49:19,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 785 transitions. [2025-02-05 22:49:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:49:19,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:49:19,446 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:49:19,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:49:19,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:49:19,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:49:19,446 INFO L85 PathProgramCache]: Analyzing trace with hash 873989590, now seen corresponding path program 1 times [2025-02-05 22:49:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:49:19,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468909882] [2025-02-05 22:49:19,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:49:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:49:19,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:49:19,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:49:19,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:49:19,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:49:25,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:49:25,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468909882] [2025-02-05 22:49:25,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468909882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:49:25,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:49:25,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:49:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887844985] [2025-02-05 22:49:25,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:49:25,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:49:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:49:25,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:49:25,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:49:25,166 INFO L87 Difference]: Start difference. First operand 527 states and 785 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 22:49:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:49:27,130 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2025-02-05 22:49:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:49:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-02-05 22:49:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:49:27,137 INFO L225 Difference]: With dead ends: 1340 [2025-02-05 22:49:27,137 INFO L226 Difference]: Without dead ends: 816 [2025-02-05 22:49:27,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-02-05 22:49:27,139 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 854 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:49:27,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 891 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:49:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-02-05 22:49:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 719. [2025-02-05 22:49:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 528 states have (on average 1.356060606060606) internal successors, (716), 533 states have internal predecessors, (716), 170 states have call successors, (170), 20 states have call predecessors, (170), 20 states have return successors, (170), 165 states have call predecessors, (170), 170 states have call successors, (170) [2025-02-05 22:49:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1056 transitions. [2025-02-05 22:49:27,211 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1056 transitions. Word has length 160 [2025-02-05 22:49:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:49:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1056 transitions. [2025-02-05 22:49:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 22:49:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1056 transitions. [2025-02-05 22:49:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:49:27,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:49:27,216 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:49:27,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:49:27,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:49:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:49:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1384523767, now seen corresponding path program 1 times [2025-02-05 22:49:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:49:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721125094] [2025-02-05 22:49:27,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:49:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:49:27,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:49:27,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:49:27,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:49:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:49:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:49:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721125094] [2025-02-05 22:49:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721125094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:49:27,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:49:27,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:49:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995818101] [2025-02-05 22:49:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:49:27,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:49:27,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:49:27,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:49:27,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:49:27,287 INFO L87 Difference]: Start difference. First operand 719 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:49:27,522 INFO L93 Difference]: Finished difference Result 1446 states and 2116 transitions. [2025-02-05 22:49:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:49:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 22:49:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:49:27,527 INFO L225 Difference]: With dead ends: 1446 [2025-02-05 22:49:27,527 INFO L226 Difference]: Without dead ends: 789 [2025-02-05 22:49:27,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:49:27,532 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 107 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:49:27,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 440 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:49:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-05 22:49:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 721. [2025-02-05 22:49:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 530 states have (on average 1.3547169811320754) internal successors, (718), 535 states have internal predecessors, (718), 170 states have call successors, (170), 20 states have call predecessors, (170), 20 states have return successors, (170), 165 states have call predecessors, (170), 170 states have call successors, (170) [2025-02-05 22:49:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1058 transitions. [2025-02-05 22:49:27,649 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1058 transitions. Word has length 160 [2025-02-05 22:49:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:49:27,649 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1058 transitions. [2025-02-05 22:49:27,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:49:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1058 transitions. [2025-02-05 22:49:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:49:27,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:49:27,652 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:49:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:49:27,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:49:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:49:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1034358615, now seen corresponding path program 1 times [2025-02-05 22:49:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:49:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223244957] [2025-02-05 22:49:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:49:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:49:27,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:49:27,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:49:27,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:49:27,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-02-05 22:49:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:49:30,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223244957] [2025-02-05 22:49:30,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223244957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:49:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740911064] [2025-02-05 22:49:30,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:49:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:49:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:49:30,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:49:30,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:49:30,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:49:30,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:49:30,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:49:30,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:49:30,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 22:49:30,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:49:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 576 proven. 276 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-02-05 22:49:33,610 INFO L312 TraceCheckSpWp]: Computing backward predicates...