./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.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_loopvsstraightlinecode_100-while_file-67.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 83ed3ec8bcd09c585992790b95e2966a76e5b0e36e2946c8579c171a77252508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:03:00,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:03:00,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:03:00,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:03:00,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:03:00,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:03:00,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:03:00,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:03:00,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:03:00,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:03:00,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:03:00,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:03:00,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:03:00,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:03:00,521 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:03:00,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:03:00,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:03:00,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:03:00,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:03:00,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:03:00,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:03:00,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:03:00,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:03:00,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:03:00,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:03:00,524 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 -> 83ed3ec8bcd09c585992790b95e2966a76e5b0e36e2946c8579c171a77252508 [2025-02-06 01:03:00,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:03:00,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:03:00,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:03:00,763 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:03:00,764 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:03:00,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.i [2025-02-06 01:03:01,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e53f7ce/3ab95e5fa60f4371a9a385aa1ccf4aea/FLAGfae2e5c50 [2025-02-06 01:03:02,188 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:03:02,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-67.i [2025-02-06 01:03:02,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e53f7ce/3ab95e5fa60f4371a9a385aa1ccf4aea/FLAGfae2e5c50 [2025-02-06 01:03:02,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3e53f7ce/3ab95e5fa60f4371a9a385aa1ccf4aea [2025-02-06 01:03:02,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:03:02,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:03:02,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:03:02,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:03:02,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:03:02,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02, skipping insertion in model container [2025-02-06 01:03:02,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:03:02,639 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_loopvsstraightlinecode_100-while_file-67.i[916,929] [2025-02-06 01:03:02,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:03:02,733 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:03:02,744 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_loopvsstraightlinecode_100-while_file-67.i[916,929] [2025-02-06 01:03:02,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:03:02,796 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:03:02,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02 WrapperNode [2025-02-06 01:03:02,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:03:02,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:03:02,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:03:02,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:03:02,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,848 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-02-06 01:03:02,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:03:02,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:03:02,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:03:02,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:03:02,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,884 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-06 01:03:02,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:03:02,905 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:03:02,905 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:03:02,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:03:02,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (1/1) ... [2025-02-06 01:03:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:03:02,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:02,933 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-06 01:03:02,936 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-06 01:03:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:03:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:03:02,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:03:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:03:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:03:02,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:03:03,028 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:03:03,030 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:03:03,341 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: havoc property_#t~bitwise22#1; [2025-02-06 01:03:03,375 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-06 01:03:03,375 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:03:03,393 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:03:03,394 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:03:03,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:03:03 BoogieIcfgContainer [2025-02-06 01:03:03,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:03:03,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:03:03,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:03:03,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:03:03,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:03:02" (1/3) ... [2025-02-06 01:03:03,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f13f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:03:03, skipping insertion in model container [2025-02-06 01:03:03,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:02" (2/3) ... [2025-02-06 01:03:03,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f13f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:03:03, skipping insertion in model container [2025-02-06 01:03:03,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:03:03" (3/3) ... [2025-02-06 01:03:03,402 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-67.i [2025-02-06 01:03:03,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:03:03,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-67.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:03:03,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:03:03,461 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;@621e79d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:03:03,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:03:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 01:03:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 01:03:03,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:03,476 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:03,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -26673458, now seen corresponding path program 1 times [2025-02-06 01:03:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:03,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609944686] [2025-02-06 01:03:03,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:03,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 01:03:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 01:03:03,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:03,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-06 01:03:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609944686] [2025-02-06 01:03:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609944686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:03:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086531263] [2025-02-06 01:03:03,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:03,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:03,836 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-06 01:03:03,838 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-06 01:03:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 01:03:03,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 01:03:03,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:03,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:03,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:03:04,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:03:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-06 01:03:04,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:03:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086531263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:03:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:03:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763366820] [2025-02-06 01:03:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:04,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:03:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:03:04,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:03:04,053 INFO L87 Difference]: Start difference. First operand has 104 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 01:03:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:04,087 INFO L93 Difference]: Finished difference Result 202 states and 354 transitions. [2025-02-06 01:03:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:03:04,089 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-02-06 01:03:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:04,093 INFO L225 Difference]: With dead ends: 202 [2025-02-06 01:03:04,093 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 01:03:04,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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-06 01:03:04,097 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:04,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:03:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 01:03:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 01:03:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 01:03:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2025-02-06 01:03:04,132 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 159 transitions. Word has length 203 [2025-02-06 01:03:04,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:04,133 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 159 transitions. [2025-02-06 01:03:04,133 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 01:03:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 159 transitions. [2025-02-06 01:03:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 01:03:04,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:04,135 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:04,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:03:04,336 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-06 01:03:04,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:04,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1087712691, now seen corresponding path program 1 times [2025-02-06 01:03:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:04,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934123773] [2025-02-06 01:03:04,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:04,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 01:03:04,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 01:03:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934123773] [2025-02-06 01:03:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934123773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:03:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415698538] [2025-02-06 01:03:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:04,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:03:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:04,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:03:04,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:03:04,546 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:04,659 INFO L93 Difference]: Finished difference Result 293 states and 463 transitions. [2025-02-06 01:03:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:03:04,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-02-06 01:03:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:04,663 INFO L225 Difference]: With dead ends: 293 [2025-02-06 01:03:04,664 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 01:03:04,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:03:04,665 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 137 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:04,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 379 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:03:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 01:03:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-02-06 01:03:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 01:03:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-02-06 01:03:04,698 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 203 [2025-02-06 01:03:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:04,698 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-02-06 01:03:04,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-02-06 01:03:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 01:03:04,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:04,701 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:04,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:03:04,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:04,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1423252549, now seen corresponding path program 1 times [2025-02-06 01:03:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:04,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139796724] [2025-02-06 01:03:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:04,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:04,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 01:03:04,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 01:03:04,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:04,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139796724] [2025-02-06 01:03:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139796724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:03:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685156778] [2025-02-06 01:03:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:03:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:05,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:03:05,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:03:05,351 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:05,639 INFO L93 Difference]: Finished difference Result 605 states and 938 transitions. [2025-02-06 01:03:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:03:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-02-06 01:03:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:05,643 INFO L225 Difference]: With dead ends: 605 [2025-02-06 01:03:05,643 INFO L226 Difference]: Without dead ends: 415 [2025-02-06 01:03:05,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 01:03:05,648 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 168 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:05,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 443 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:03:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-06 01:03:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 397. [2025-02-06 01:03:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 268 states have (on average 1.3694029850746268) internal successors, (367), 268 states have internal predecessors, (367), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 01:03:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 615 transitions. [2025-02-06 01:03:05,704 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 615 transitions. Word has length 204 [2025-02-06 01:03:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:05,704 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 615 transitions. [2025-02-06 01:03:05,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 615 transitions. [2025-02-06 01:03:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 01:03:05,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:05,707 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:05,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:03:05,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:05,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -885811789, now seen corresponding path program 1 times [2025-02-06 01:03:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12149517] [2025-02-06 01:03:05,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:05,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:05,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 01:03:05,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 01:03:05,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:05,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:06,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:06,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12149517] [2025-02-06 01:03:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12149517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:03:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073787620] [2025-02-06 01:03:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:06,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:03:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:06,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:03:06,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:03:06,039 INFO L87 Difference]: Start difference. First operand 397 states and 615 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:06,304 INFO L93 Difference]: Finished difference Result 809 states and 1247 transitions. [2025-02-06 01:03:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:03:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-02-06 01:03:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:06,310 INFO L225 Difference]: With dead ends: 809 [2025-02-06 01:03:06,312 INFO L226 Difference]: Without dead ends: 415 [2025-02-06 01:03:06,313 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-06 01:03:06,313 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:06,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 446 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:03:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-06 01:03:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 399. [2025-02-06 01:03:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 270 states have internal predecessors, (365), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 01:03:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 613 transitions. [2025-02-06 01:03:06,367 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 613 transitions. Word has length 206 [2025-02-06 01:03:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:06,368 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 613 transitions. [2025-02-06 01:03:06,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 613 transitions. [2025-02-06 01:03:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 01:03:06,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:06,372 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:06,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:03:06,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:06,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1225925250, now seen corresponding path program 1 times [2025-02-06 01:03:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800156608] [2025-02-06 01:03:06,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:06,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 01:03:06,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 01:03:06,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:06,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:10,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:10,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800156608] [2025-02-06 01:03:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800156608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:10,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:10,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:03:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599319313] [2025-02-06 01:03:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:10,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:03:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:10,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:03:10,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:03:10,388 INFO L87 Difference]: Start difference. First operand 399 states and 613 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:11,525 INFO L93 Difference]: Finished difference Result 1192 states and 1825 transitions. [2025-02-06 01:03:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:03:11,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 01:03:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:11,532 INFO L225 Difference]: With dead ends: 1192 [2025-02-06 01:03:11,532 INFO L226 Difference]: Without dead ends: 999 [2025-02-06 01:03:11,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-02-06 01:03:11,534 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 405 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:11,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 936 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 01:03:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-02-06 01:03:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 784. [2025-02-06 01:03:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 559 states have (on average 1.4007155635062611) internal successors, (783), 559 states have internal predecessors, (783), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2025-02-06 01:03:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1217 transitions. [2025-02-06 01:03:11,626 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1217 transitions. Word has length 208 [2025-02-06 01:03:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:11,626 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1217 transitions. [2025-02-06 01:03:11,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1217 transitions. [2025-02-06 01:03:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 01:03:11,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:11,631 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:11,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:03:11,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:11,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -571026109, now seen corresponding path program 1 times [2025-02-06 01:03:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856054034] [2025-02-06 01:03:11,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:11,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 01:03:11,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 01:03:11,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:11,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856054034] [2025-02-06 01:03:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856054034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:03:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96219521] [2025-02-06 01:03:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:11,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:03:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:11,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:03:11,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:03:11,783 INFO L87 Difference]: Start difference. First operand 784 states and 1217 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:11,888 INFO L93 Difference]: Finished difference Result 1856 states and 2888 transitions. [2025-02-06 01:03:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:03:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 01:03:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:11,895 INFO L225 Difference]: With dead ends: 1856 [2025-02-06 01:03:11,895 INFO L226 Difference]: Without dead ends: 1142 [2025-02-06 01:03:11,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:03:11,898 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 93 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:11,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 617 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:03:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-02-06 01:03:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2025-02-06 01:03:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 819 states have (on average 1.4017094017094016) internal successors, (1148), 819 states have internal predecessors, (1148), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2025-02-06 01:03:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1768 transitions. [2025-02-06 01:03:11,988 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1768 transitions. Word has length 208 [2025-02-06 01:03:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1768 transitions. [2025-02-06 01:03:11,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1768 transitions. [2025-02-06 01:03:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 01:03:11,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:11,990 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:11,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:03:11,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:11,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash 715391073, now seen corresponding path program 1 times [2025-02-06 01:03:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529301592] [2025-02-06 01:03:11,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:12,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 01:03:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 01:03:12,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:12,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:13,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529301592] [2025-02-06 01:03:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529301592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:03:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853244279] [2025-02-06 01:03:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:13,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:03:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:13,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:03:13,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:13,516 INFO L87 Difference]: Start difference. First operand 1140 states and 1768 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:13,960 INFO L93 Difference]: Finished difference Result 1778 states and 2765 transitions. [2025-02-06 01:03:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:03:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-02-06 01:03:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:13,968 INFO L225 Difference]: With dead ends: 1778 [2025-02-06 01:03:13,968 INFO L226 Difference]: Without dead ends: 1433 [2025-02-06 01:03:13,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:03:13,970 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 195 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:13,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 776 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:03:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-02-06 01:03:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1418. [2025-02-06 01:03:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1033 states have (on average 1.4133591481122942) internal successors, (1460), 1033 states have internal predecessors, (1460), 372 states have call successors, (372), 12 states have call predecessors, (372), 12 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-02-06 01:03:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2204 transitions. [2025-02-06 01:03:14,059 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2204 transitions. Word has length 208 [2025-02-06 01:03:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:14,060 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2204 transitions. [2025-02-06 01:03:14,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2204 transitions. [2025-02-06 01:03:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-06 01:03:14,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:14,062 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:14,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 01:03:14,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:14,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1601810859, now seen corresponding path program 1 times [2025-02-06 01:03:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548728664] [2025-02-06 01:03:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:14,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 01:03:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 01:03:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-06 01:03:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:14,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548728664] [2025-02-06 01:03:14,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548728664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:03:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949554196] [2025-02-06 01:03:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:14,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:03:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:14,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:03:14,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:03:14,259 INFO L87 Difference]: Start difference. First operand 1418 states and 2204 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:14,434 INFO L93 Difference]: Finished difference Result 2643 states and 4077 transitions. [2025-02-06 01:03:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:03:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-02-06 01:03:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:14,444 INFO L225 Difference]: With dead ends: 2643 [2025-02-06 01:03:14,445 INFO L226 Difference]: Without dead ends: 1292 [2025-02-06 01:03:14,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:14,448 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 184 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:14,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 602 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:03:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-02-06 01:03:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1232. [2025-02-06 01:03:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 847 states have (on average 1.3565525383707202) internal successors, (1149), 847 states have internal predecessors, (1149), 372 states have call successors, (372), 12 states have call predecessors, (372), 12 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-02-06 01:03:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1893 transitions. [2025-02-06 01:03:14,541 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1893 transitions. Word has length 209 [2025-02-06 01:03:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:14,541 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1893 transitions. [2025-02-06 01:03:14,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-06 01:03:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1893 transitions. [2025-02-06 01:03:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-06 01:03:14,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:14,543 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 01:03:14,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:14,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1931518511, now seen corresponding path program 1 times [2025-02-06 01:03:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:14,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879611297] [2025-02-06 01:03:14,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:14,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 01:03:14,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 01:03:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:44,448 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:03:52,467 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:04:04,568 WARN L286 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:04:12,691 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:04:24,832 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)