./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.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-pr-ci_file-10.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 69eea854146ed6719c2a02b1e3c48ec2ec3340ce1e8957b9754599908f0bff1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:52:51,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:52:51,394 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:52:51,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:52:51,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:52:51,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:52:51,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:52:51,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:52:51,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:52:51,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:52:51,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:52:51,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:52:51,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:52:51,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:52:51,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:52:51,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:52:51,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:52:51,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:52:51,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:52:51,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:52:51,431 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 -> 69eea854146ed6719c2a02b1e3c48ec2ec3340ce1e8957b9754599908f0bff1b [2025-02-05 22:52:51,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:52:51,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:52:51,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:52:51,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:52:51,642 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:52:51,643 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-pr-ci_file-10.i [2025-02-05 22:52:52,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9594c885f/a2b9cd1d406a4a09a9016fe1f58ee7f2/FLAGa303f72a5 [2025-02-05 22:52:53,120 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:52:53,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2025-02-05 22:52:53,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9594c885f/a2b9cd1d406a4a09a9016fe1f58ee7f2/FLAGa303f72a5 [2025-02-05 22:52:53,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9594c885f/a2b9cd1d406a4a09a9016fe1f58ee7f2 [2025-02-05 22:52:53,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:52:53,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:52:53,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:52:53,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:52:53,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:52:53,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53, skipping insertion in model container [2025-02-05 22:52:53,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:52:53,284 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-pr-ci_file-10.i[919,932] [2025-02-05 22:52:53,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:52:53,362 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:52:53,370 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-pr-ci_file-10.i[919,932] [2025-02-05 22:52:53,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:52:53,416 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:52:53,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53 WrapperNode [2025-02-05 22:52:53,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:52:53,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:52:53,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:52:53,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:52:53,426 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:52:53" (1/1) ... [2025-02-05 22:52:53,436 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:52:53" (1/1) ... [2025-02-05 22:52:53,469 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 295 [2025-02-05 22:52:53,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:52:53,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:52:53,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:52:53,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:52:53,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,508 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:52:53,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:52:53,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:52:53,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:52:53,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:52:53,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (1/1) ... [2025-02-05 22:52:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:52:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:52:53,563 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:52:53,572 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:52:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:52:53,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:52:53,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:52:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:52:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:52:53,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:52:53,675 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:52:53,677 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:52:54,110 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise32#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short35#1; [2025-02-05 22:52:54,164 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-05 22:52:54,164 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:52:54,190 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:52:54,191 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:52:54,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:54 BoogieIcfgContainer [2025-02-05 22:52:54,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:52:54,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:52:54,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:52:54,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:52:54,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:52:53" (1/3) ... [2025-02-05 22:52:54,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cdc07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:52:54, skipping insertion in model container [2025-02-05 22:52:54,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:53" (2/3) ... [2025-02-05 22:52:54,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cdc07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:52:54, skipping insertion in model container [2025-02-05 22:52:54,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:54" (3/3) ... [2025-02-05 22:52:54,203 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2025-02-05 22:52:54,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:52:54,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:52:54,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:52:54,274 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;@121b0693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:52:54,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:52:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 22:52:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 22:52:54,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:54,288 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:54,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1820840392, now seen corresponding path program 1 times [2025-02-05 22:52:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080319958] [2025-02-05 22:52:54,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:54,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:54,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 22:52:54,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 22:52:54,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:54,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 22:52:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080319958] [2025-02-05 22:52:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080319958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:52:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730168819] [2025-02-05 22:52:54,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:54,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:52:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:52:54,589 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:52:54,591 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:52:54,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 22:52:54,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 22:52:54,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:54,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:54,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:52:54,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:52:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 22:52:54,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:52:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730168819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:52:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:52:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581004785] [2025-02-05 22:52:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:54,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:52:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:52:54,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:52:54,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:52:54,847 INFO L87 Difference]: Start difference. First operand has 125 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 22:52:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:54,884 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2025-02-05 22:52:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:52:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 218 [2025-02-05 22:52:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:54,891 INFO L225 Difference]: With dead ends: 244 [2025-02-05 22:52:54,891 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 22:52:54,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 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:52:54,896 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:54,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:52:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 22:52:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-05 22:52:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 22:52:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 190 transitions. [2025-02-05 22:52:54,932 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 190 transitions. Word has length 218 [2025-02-05 22:52:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:54,932 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 190 transitions. [2025-02-05 22:52:54,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 22:52:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 190 transitions. [2025-02-05 22:52:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 22:52:54,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:54,936 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,946 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:52:55,141 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:52:55,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:55,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash 407622372, now seen corresponding path program 1 times [2025-02-05 22:52:55,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291150777] [2025-02-05 22:52:55,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:55,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 22:52:55,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 22:52:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:52:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291150777] [2025-02-05 22:52:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291150777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:55,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:52:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:52:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297855244] [2025-02-05 22:52:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:55,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:52:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:52:55,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:52:55,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:52:55,819 INFO L87 Difference]: Start difference. First operand 122 states and 190 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:52:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:56,051 INFO L93 Difference]: Finished difference Result 361 states and 565 transitions. [2025-02-05 22:52:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:52:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-02-05 22:52:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:56,054 INFO L225 Difference]: With dead ends: 361 [2025-02-05 22:52:56,054 INFO L226 Difference]: Without dead ends: 242 [2025-02-05 22:52:56,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:52:56,057 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 128 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:56,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 517 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:52:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-05 22:52:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 183. [2025-02-05 22:52:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 112 states have internal predecessors, (148), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:52:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 284 transitions. [2025-02-05 22:52:56,109 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 284 transitions. Word has length 218 [2025-02-05 22:52:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:56,111 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 284 transitions. [2025-02-05 22:52:56,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:52:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 284 transitions. [2025-02-05 22:52:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:52:56,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:56,114 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:52:56,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:56,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1558153753, now seen corresponding path program 1 times [2025-02-05 22:52:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864219519] [2025-02-05 22:52:56,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:56,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:52:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:52:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864219519] [2025-02-05 22:53:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864219519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:02,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 22:53:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282347185] [2025-02-05 22:53:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:02,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:53:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:02,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:53:02,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:53:02,745 INFO L87 Difference]: Start difference. First operand 183 states and 284 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 22:53:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:06,671 INFO L93 Difference]: Finished difference Result 635 states and 960 transitions. [2025-02-05 22:53:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 22:53:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 219 [2025-02-05 22:53:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:06,677 INFO L225 Difference]: With dead ends: 635 [2025-02-05 22:53:06,677 INFO L226 Difference]: Without dead ends: 516 [2025-02-05 22:53:06,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 22:53:06,679 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 981 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:06,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1585 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 22:53:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-05 22:53:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 369. [2025-02-05 22:53:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 258 states have (on average 1.3604651162790697) internal successors, (351), 259 states have internal predecessors, (351), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 555 transitions. [2025-02-05 22:53:06,713 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 555 transitions. Word has length 219 [2025-02-05 22:53:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:06,713 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 555 transitions. [2025-02-05 22:53:06,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 22:53:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 555 transitions. [2025-02-05 22:53:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:06,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:06,716 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:06,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:53:06,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1687236472, now seen corresponding path program 1 times [2025-02-05 22:53:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675300218] [2025-02-05 22:53:06,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:06,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675300218] [2025-02-05 22:53:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675300218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:15,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:53:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733897339] [2025-02-05 22:53:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:15,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:53:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:15,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:53:15,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:53:15,672 INFO L87 Difference]: Start difference. First operand 369 states and 555 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:17,601 INFO L93 Difference]: Finished difference Result 978 states and 1442 transitions. [2025-02-05 22:53:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 22:53:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 22:53:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:17,610 INFO L225 Difference]: With dead ends: 978 [2025-02-05 22:53:17,610 INFO L226 Difference]: Without dead ends: 859 [2025-02-05 22:53:17,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:53:17,611 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 950 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:17,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 935 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:53:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-05 22:53:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 422. [2025-02-05 22:53:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 311 states have (on average 1.392282958199357) internal successors, (433), 311 states have internal predecessors, (433), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2025-02-05 22:53:17,654 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 219 [2025-02-05 22:53:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:17,654 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2025-02-05 22:53:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2025-02-05 22:53:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:17,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:17,657 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:17,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:53:17,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:17,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1149329528, now seen corresponding path program 1 times [2025-02-05 22:53:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:17,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801885535] [2025-02-05 22:53:17,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:17,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:23,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801885535] [2025-02-05 22:53:23,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801885535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:23,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 22:53:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119388938] [2025-02-05 22:53:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:23,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:53:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:23,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:53:23,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:53:23,366 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 22:53:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:27,142 INFO L93 Difference]: Finished difference Result 889 states and 1329 transitions. [2025-02-05 22:53:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 22:53:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 219 [2025-02-05 22:53:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:27,146 INFO L225 Difference]: With dead ends: 889 [2025-02-05 22:53:27,146 INFO L226 Difference]: Without dead ends: 561 [2025-02-05 22:53:27,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 22:53:27,147 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1045 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:27,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1329 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 22:53:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-05 22:53:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 427. [2025-02-05 22:53:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 316 states have (on average 1.389240506329114) internal successors, (439), 316 states have internal predecessors, (439), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 643 transitions. [2025-02-05 22:53:27,175 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 643 transitions. Word has length 219 [2025-02-05 22:53:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:27,175 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 643 transitions. [2025-02-05 22:53:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 22:53:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 643 transitions. [2025-02-05 22:53:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:27,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:27,181 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:27,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:53:27,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:27,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1278412247, now seen corresponding path program 1 times [2025-02-05 22:53:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:27,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684087505] [2025-02-05 22:53:27,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:27,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:27,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:27,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:27,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:31,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684087505] [2025-02-05 22:53:31,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684087505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:31,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:53:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150999364] [2025-02-05 22:53:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:31,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:53:31,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:31,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:53:31,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:53:31,663 INFO L87 Difference]: Start difference. First operand 427 states and 643 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:35,230 INFO L93 Difference]: Finished difference Result 1200 states and 1783 transitions. [2025-02-05 22:53:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 22:53:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 22:53:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:35,237 INFO L225 Difference]: With dead ends: 1200 [2025-02-05 22:53:35,237 INFO L226 Difference]: Without dead ends: 1045 [2025-02-05 22:53:35,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 22:53:35,238 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1380 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:35,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1452 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 22:53:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-02-05 22:53:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 479. [2025-02-05 22:53:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 368 states have (on average 1.4157608695652173) internal successors, (521), 368 states have internal predecessors, (521), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 725 transitions. [2025-02-05 22:53:35,269 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 725 transitions. Word has length 219 [2025-02-05 22:53:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:35,270 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 725 transitions. [2025-02-05 22:53:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 725 transitions. [2025-02-05 22:53:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:35,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:35,272 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:53:35,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -45497351, now seen corresponding path program 1 times [2025-02-05 22:53:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425017518] [2025-02-05 22:53:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:35,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:35,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425017518] [2025-02-05 22:53:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425017518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 22:53:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858222420] [2025-02-05 22:53:38,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:38,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:53:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:38,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:53:38,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:53:38,669 INFO L87 Difference]: Start difference. First operand 479 states and 725 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:40,895 INFO L93 Difference]: Finished difference Result 1106 states and 1649 transitions. [2025-02-05 22:53:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 22:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 22:53:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:40,899 INFO L225 Difference]: With dead ends: 1106 [2025-02-05 22:53:40,899 INFO L226 Difference]: Without dead ends: 939 [2025-02-05 22:53:40,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:53:40,901 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1179 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:40,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1242 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 22:53:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-02-05 22:53:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 539. [2025-02-05 22:53:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 426 states have (on average 1.4413145539906103) internal successors, (614), 426 states have internal predecessors, (614), 102 states have call successors, (102), 10 states have call predecessors, (102), 10 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 818 transitions. [2025-02-05 22:53:40,922 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 818 transitions. Word has length 219 [2025-02-05 22:53:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:40,922 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 818 transitions. [2025-02-05 22:53:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 818 transitions. [2025-02-05 22:53:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:40,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:40,924 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:40,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:53:40,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:40,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1795298137, now seen corresponding path program 1 times [2025-02-05 22:53:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931360549] [2025-02-05 22:53:40,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:40,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:40,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:40,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:40,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931360549] [2025-02-05 22:53:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931360549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 22:53:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255147711] [2025-02-05 22:53:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 22:53:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:47,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 22:53:47,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:53:47,591 INFO L87 Difference]: Start difference. First operand 539 states and 818 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 22:53:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:51,411 INFO L93 Difference]: Finished difference Result 1205 states and 1810 transitions. [2025-02-05 22:53:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 22:53:51,412 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 219 [2025-02-05 22:53:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:51,415 INFO L225 Difference]: With dead ends: 1205 [2025-02-05 22:53:51,416 INFO L226 Difference]: Without dead ends: 803 [2025-02-05 22:53:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2025-02-05 22:53:51,417 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 881 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1293 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 22:53:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-02-05 22:53:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 558. [2025-02-05 22:53:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 443 states have (on average 1.435665914221219) internal successors, (636), 443 states have internal predecessors, (636), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 840 transitions. [2025-02-05 22:53:51,443 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 840 transitions. Word has length 219 [2025-02-05 22:53:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 840 transitions. [2025-02-05 22:53:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 22:53:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 840 transitions. [2025-02-05 22:53:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:51,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:51,447 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:53:51,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2016124294, now seen corresponding path program 1 times [2025-02-05 22:53:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762437025] [2025-02-05 22:53:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:51,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:51,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:51,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:51,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:53:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762437025] [2025-02-05 22:53:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762437025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 22:53:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296691095] [2025-02-05 22:53:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 22:53:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:52,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 22:53:52,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:53:52,687 INFO L87 Difference]: Start difference. First operand 558 states and 840 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:53,387 INFO L93 Difference]: Finished difference Result 1144 states and 1734 transitions. [2025-02-05 22:53:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 22:53:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 22:53:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:53,391 INFO L225 Difference]: With dead ends: 1144 [2025-02-05 22:53:53,391 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 22:53:53,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:53:53,393 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 373 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:53,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1190 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:53:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 22:53:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 549. [2025-02-05 22:53:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 434 states have (on average 1.433179723502304) internal successors, (622), 434 states have internal predecessors, (622), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 22:53:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 826 transitions. [2025-02-05 22:53:53,416 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 826 transitions. Word has length 219 [2025-02-05 22:53:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:53,417 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 826 transitions. [2025-02-05 22:53:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:53:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 826 transitions. [2025-02-05 22:53:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 22:53:53,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:53,418 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:53,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:53:53,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:53,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1492049062, now seen corresponding path program 1 times [2025-02-05 22:53:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437575135] [2025-02-05 22:53:53,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:53,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 22:53:53,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 22:53:53,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:53,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:54:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:54:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437575135] [2025-02-05 22:54:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437575135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:54:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:54:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 22:54:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695069207] [2025-02-05 22:54:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:54:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 22:54:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:54:18,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 22:54:18,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-02-05 22:54:18,999 INFO L87 Difference]: Start difference. First operand 549 states and 826 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)