./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-34.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_fillercodesize_ps-cn-50_file-34.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 56ab96e739c021e0a820f09f7d8df07ac4eb08fdb70334870660d3f078d5cedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:06:48,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:06:48,762 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:06:48,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:06:48,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:06:48,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:06:48,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:06:48,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:06:48,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:06:48,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:06:48,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:06:48,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:06:48,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:06:48,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:06:48,798 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:06:48,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:06:48,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:06:48,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:06:48,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:06:48,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:06:48,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:06:48,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:06:48,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:06:48,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:06:48,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:06:48,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:06:48,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:06:48,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:06:48,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:06:48,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:06:48,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:06:48,802 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 -> 56ab96e739c021e0a820f09f7d8df07ac4eb08fdb70334870660d3f078d5cedf [2025-02-05 22:06:49,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:06:49,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:06:49,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:06:49,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:06:49,080 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:06:49,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-34.i [2025-02-05 22:06:50,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f64c52216/f4a36a342a3d4e8dad0ba1734d05b3ba/FLAG2e09c9479 [2025-02-05 22:06:50,816 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:06:50,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-34.i [2025-02-05 22:06:50,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f64c52216/f4a36a342a3d4e8dad0ba1734d05b3ba/FLAG2e09c9479 [2025-02-05 22:06:51,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f64c52216/f4a36a342a3d4e8dad0ba1734d05b3ba [2025-02-05 22:06:51,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:06:51,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:06:51,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:06:51,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:06:51,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:06:51,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b56f174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51, skipping insertion in model container [2025-02-05 22:06:51,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:06:51,283 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_fillercodesize_ps-cn-50_file-34.i[915,928] [2025-02-05 22:06:51,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:06:51,399 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:06:51,412 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_fillercodesize_ps-cn-50_file-34.i[915,928] [2025-02-05 22:06:51,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:06:51,487 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:06:51,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51 WrapperNode [2025-02-05 22:06:51,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:06:51,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:06:51,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:06:51,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:06:51,495 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:06:51" (1/1) ... [2025-02-05 22:06:51,512 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:06:51" (1/1) ... [2025-02-05 22:06:51,554 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-02-05 22:06:51,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:06:51,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:06:51,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:06:51,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:06:51,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,594 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:06:51,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:06:51,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:06:51,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:06:51,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:06:51,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (1/1) ... [2025-02-05 22:06:51,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:06:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:06:51,672 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:06:51,676 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:06:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:06:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:06:51,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:06:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:06:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:06:51,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:06:51,770 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:06:51,771 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:06:52,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2025-02-05 22:06:52,306 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 22:06:52,306 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:06:52,336 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:06:52,337 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:06:52,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:06:52 BoogieIcfgContainer [2025-02-05 22:06:52,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:06:52,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:06:52,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:06:52,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:06:52,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:06:51" (1/3) ... [2025-02-05 22:06:52,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d34377d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:06:52, skipping insertion in model container [2025-02-05 22:06:52,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:06:51" (2/3) ... [2025-02-05 22:06:52,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d34377d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:06:52, skipping insertion in model container [2025-02-05 22:06:52,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:06:52" (3/3) ... [2025-02-05 22:06:52,350 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-34.i [2025-02-05 22:06:52,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:06:52,367 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-34.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:06:52,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:06:52,446 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;@7ed8a0d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:06:52,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:06:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 22:06:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:06:52,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:06:52,472 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:06:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:06:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 687538634, now seen corresponding path program 1 times [2025-02-05 22:06:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:06:52,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573676849] [2025-02-05 22:06:52,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:06:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:06:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:06:52,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:06:52,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:06:52,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:06:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-02-05 22:06:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:06:52,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573676849] [2025-02-05 22:06:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573676849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:06:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558516731] [2025-02-05 22:06:52,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:06:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:06:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:06:52,914 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:06:52,917 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:06:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:06:53,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:06:53,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:06:53,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:06:53,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:06:53,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:06:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-02-05 22:06:53,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:06:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558516731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:06:53,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:06:53,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:06:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021921240] [2025-02-05 22:06:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:06:53,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:06:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:06:53,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:06:53,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:06:53,221 INFO L87 Difference]: Start difference. First operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 22:06:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:06:53,263 INFO L93 Difference]: Finished difference Result 216 states and 380 transitions. [2025-02-05 22:06:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:06:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2025-02-05 22:06:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:06:53,275 INFO L225 Difference]: With dead ends: 216 [2025-02-05 22:06:53,276 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 22:06:53,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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:06:53,288 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:06:53,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:06:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 22:06:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-05 22:06:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 22:06:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions. [2025-02-05 22:06:53,352 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 212 [2025-02-05 22:06:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:06:53,353 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 171 transitions. [2025-02-05 22:06:53,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 22:06:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2025-02-05 22:06:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:06:53,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:06:53,359 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,367 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-05 22:06:53,560 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:06:53,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:06:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:06:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1320592583, now seen corresponding path program 1 times [2025-02-05 22:06:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:06:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406867737] [2025-02-05 22:06:53,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:06:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:06:53,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:06:53,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:06:53,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:06:53,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:06:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:06:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:06:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406867737] [2025-02-05 22:06:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406867737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:06:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:06:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:06:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620105272] [2025-02-05 22:06:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:06:54,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:06:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:06:54,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:06:54,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:06:54,337 INFO L87 Difference]: Start difference. First operand 108 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:06:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:06:54,579 INFO L93 Difference]: Finished difference Result 348 states and 552 transitions. [2025-02-05 22:06:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:06:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-02-05 22:06:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:06:54,583 INFO L225 Difference]: With dead ends: 348 [2025-02-05 22:06:54,583 INFO L226 Difference]: Without dead ends: 243 [2025-02-05 22:06:54,584 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:06:54,585 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 171 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:06:54,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 517 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:06:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-05 22:06:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 213. [2025-02-05 22:06:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4375) internal successors, (207), 144 states have internal predecessors, (207), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 22:06:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2025-02-05 22:06:54,641 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 212 [2025-02-05 22:06:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:06:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2025-02-05 22:06:54,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:06:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2025-02-05 22:06:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 22:06:54,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:06:54,651 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:54,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:06:54,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:06:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:06:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1426830328, now seen corresponding path program 1 times [2025-02-05 22:06:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:06:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273199106] [2025-02-05 22:06:54,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:06:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:06:54,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 22:06:54,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 22:06:54,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:06:54,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:06:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:06:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:06:55,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273199106] [2025-02-05 22:06:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273199106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:06:55,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:06:55,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:06:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420712585] [2025-02-05 22:06:55,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:06:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:06:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:06:55,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:06:55,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:06:55,038 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:06:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:06:55,455 INFO L93 Difference]: Finished difference Result 628 states and 1000 transitions. [2025-02-05 22:06:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:06:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-02-05 22:06:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:06:55,463 INFO L225 Difference]: With dead ends: 628 [2025-02-05 22:06:55,463 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 22:06:55,465 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-05 22:06:55,465 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 196 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:06:55,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 654 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:06:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 22:06:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 217. [2025-02-05 22:06:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 148 states have (on average 1.4256756756756757) internal successors, (211), 148 states have internal predecessors, (211), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 22:06:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2025-02-05 22:06:55,536 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 213 [2025-02-05 22:06:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:06:55,537 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2025-02-05 22:06:55,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:06:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2025-02-05 22:06:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:06:55,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:06:55,543 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:06:55,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:06:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:06:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1344201859, now seen corresponding path program 1 times [2025-02-05 22:06:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:06:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118183734] [2025-02-05 22:06:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:06:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:06:55,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:06:55,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:06:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:06:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:06:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:06:56,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:06:56,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118183734] [2025-02-05 22:06:56,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118183734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:06:56,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:06:56,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:06:56,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767876558] [2025-02-05 22:06:56,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:06:56,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:06:56,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:06:56,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:06:56,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:06:56,404 INFO L87 Difference]: Start difference. First operand 217 states and 343 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:06:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:06:56,807 INFO L93 Difference]: Finished difference Result 569 states and 897 transitions. [2025-02-05 22:06:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:06:56,808 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:06:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:06:56,811 INFO L225 Difference]: With dead ends: 569 [2025-02-05 22:06:56,811 INFO L226 Difference]: Without dead ends: 355 [2025-02-05 22:06:56,812 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:06:56,813 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 124 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:06:56,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 438 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:06:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-05 22:06:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 299. [2025-02-05 22:06:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 196 states have (on average 1.4081632653061225) internal successors, (276), 196 states have internal predecessors, (276), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 22:06:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 474 transitions. [2025-02-05 22:06:56,883 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 474 transitions. Word has length 214 [2025-02-05 22:06:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:06:56,885 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 474 transitions. [2025-02-05 22:06:56,885 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:06:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2025-02-05 22:06:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:06:56,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:06:56,889 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:06:56,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:06:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:06:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1849760484, now seen corresponding path program 1 times [2025-02-05 22:06:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:06:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234612246] [2025-02-05 22:06:56,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:06:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:06:56,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:06:56,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:06:56,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:06:56,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:06:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:06:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:06:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234612246] [2025-02-05 22:06:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234612246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:06:59,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:06:59,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:06:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55327296] [2025-02-05 22:06:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:06:59,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:06:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:06:59,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:06:59,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:06:59,723 INFO L87 Difference]: Start difference. First operand 299 states and 474 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:07:00,441 INFO L93 Difference]: Finished difference Result 577 states and 907 transitions. [2025-02-05 22:07:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:07:00,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:07:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:07:00,446 INFO L225 Difference]: With dead ends: 577 [2025-02-05 22:07:00,449 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 22:07:00,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:07:00,450 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 182 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:07:00,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 580 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:07:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 22:07:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 305. [2025-02-05 22:07:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 202 states have (on average 1.4059405940594059) internal successors, (284), 202 states have internal predecessors, (284), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 22:07:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 482 transitions. [2025-02-05 22:07:00,511 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 482 transitions. Word has length 214 [2025-02-05 22:07:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:07:00,512 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 482 transitions. [2025-02-05 22:07:00,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 482 transitions. [2025-02-05 22:07:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:07:00,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:07:00,514 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:00,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:07:00,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:07:00,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:07:00,515 INFO L85 PathProgramCache]: Analyzing trace with hash 300185791, now seen corresponding path program 1 times [2025-02-05 22:07:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:07:00,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556035409] [2025-02-05 22:07:00,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:07:00,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:07:00,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:07:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:07:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:07:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:07:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:07:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:07:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556035409] [2025-02-05 22:07:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556035409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:07:03,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:07:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 22:07:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892874424] [2025-02-05 22:07:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:07:03,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 22:07:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:07:03,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 22:07:03,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:07:03,557 INFO L87 Difference]: Start difference. First operand 305 states and 482 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:07:05,695 INFO L93 Difference]: Finished difference Result 769 states and 1173 transitions. [2025-02-05 22:07:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:07:05,697 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:07:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:07:05,701 INFO L225 Difference]: With dead ends: 769 [2025-02-05 22:07:05,701 INFO L226 Difference]: Without dead ends: 555 [2025-02-05 22:07:05,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:07:05,704 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 360 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:07:05,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 946 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 22:07:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-05 22:07:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 394. [2025-02-05 22:07:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 279 states have (on average 1.3942652329749103) internal successors, (389), 281 states have internal predecessors, (389), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:07:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 607 transitions. [2025-02-05 22:07:05,791 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 607 transitions. Word has length 214 [2025-02-05 22:07:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:07:05,792 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 607 transitions. [2025-02-05 22:07:05,793 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 607 transitions. [2025-02-05 22:07:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:07:05,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:07:05,798 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:05,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:07:05,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:07:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:07:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1187689472, now seen corresponding path program 1 times [2025-02-05 22:07:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:07:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129054667] [2025-02-05 22:07:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:07:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:07:05,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:07:05,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:07:05,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:07:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:07:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:07:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:07:07,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129054667] [2025-02-05 22:07:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129054667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:07:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:07:07,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:07:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989071512] [2025-02-05 22:07:07,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:07:07,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:07:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:07:07,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:07:07,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:07:07,995 INFO L87 Difference]: Start difference. First operand 394 states and 607 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:07:09,443 INFO L93 Difference]: Finished difference Result 958 states and 1438 transitions. [2025-02-05 22:07:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:07:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:07:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:07:09,451 INFO L225 Difference]: With dead ends: 958 [2025-02-05 22:07:09,451 INFO L226 Difference]: Without dead ends: 659 [2025-02-05 22:07:09,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:07:09,453 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 374 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:07:09,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 684 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:07:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-05 22:07:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 445. [2025-02-05 22:07:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 330 states have (on average 1.3848484848484848) internal successors, (457), 332 states have internal predecessors, (457), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:07:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 675 transitions. [2025-02-05 22:07:09,524 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 675 transitions. Word has length 214 [2025-02-05 22:07:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:07:09,524 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 675 transitions. [2025-02-05 22:07:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 675 transitions. [2025-02-05 22:07:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:07:09,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:07:09,527 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:09,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:07:09,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:07:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:07:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1507268672, now seen corresponding path program 1 times [2025-02-05 22:07:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:07:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235131147] [2025-02-05 22:07:09,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:07:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:07:09,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:07:09,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:07:09,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:07:09,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:07:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:07:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:07:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235131147] [2025-02-05 22:07:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235131147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:07:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:07:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:07:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391668314] [2025-02-05 22:07:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:07:12,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:07:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:07:12,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:07:12,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:07:12,136 INFO L87 Difference]: Start difference. First operand 445 states and 675 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:07:13,040 INFO L93 Difference]: Finished difference Result 1030 states and 1521 transitions. [2025-02-05 22:07:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:07:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:07:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:07:13,048 INFO L225 Difference]: With dead ends: 1030 [2025-02-05 22:07:13,048 INFO L226 Difference]: Without dead ends: 682 [2025-02-05 22:07:13,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:07:13,051 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 318 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:07:13,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 689 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:07:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-05 22:07:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 554. [2025-02-05 22:07:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 439 states have (on average 1.3781321184510251) internal successors, (605), 441 states have internal predecessors, (605), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:07:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 823 transitions. [2025-02-05 22:07:13,122 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 823 transitions. Word has length 214 [2025-02-05 22:07:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:07:13,123 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 823 transitions. [2025-02-05 22:07:13,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 823 transitions. [2025-02-05 22:07:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:07:13,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:07:13,127 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:13,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:07:13,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:07:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:07:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -210348386, now seen corresponding path program 1 times [2025-02-05 22:07:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:07:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455095038] [2025-02-05 22:07:13,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:07:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:07:13,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:07:13,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:07:13,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:07:13,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:07:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:07:15,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:07:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455095038] [2025-02-05 22:07:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455095038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:07:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:07:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 22:07:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976913692] [2025-02-05 22:07:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:07:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 22:07:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:07:15,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 22:07:15,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:07:15,371 INFO L87 Difference]: Start difference. First operand 554 states and 823 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:07:17,792 INFO L93 Difference]: Finished difference Result 936 states and 1397 transitions. [2025-02-05 22:07:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:07:17,793 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:07:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:07:17,799 INFO L225 Difference]: With dead ends: 936 [2025-02-05 22:07:17,800 INFO L226 Difference]: Without dead ends: 784 [2025-02-05 22:07:17,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:07:17,802 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 491 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:07:17,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1622 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 22:07:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-02-05 22:07:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 681. [2025-02-05 22:07:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 532 states have (on average 1.3778195488721805) internal successors, (733), 534 states have internal predecessors, (733), 142 states have call successors, (142), 6 states have call predecessors, (142), 6 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2025-02-05 22:07:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1017 transitions. [2025-02-05 22:07:17,864 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1017 transitions. Word has length 214 [2025-02-05 22:07:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:07:17,864 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1017 transitions. [2025-02-05 22:07:17,864 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1017 transitions. [2025-02-05 22:07:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 22:07:17,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:07:17,866 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:17,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:07:17,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:07:17,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:07:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1127235667, now seen corresponding path program 1 times [2025-02-05 22:07:17,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:07:17,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242657073] [2025-02-05 22:07:17,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:07:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:07:17,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 22:07:17,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 22:07:17,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:07:17,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:07:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:07:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:07:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242657073] [2025-02-05 22:07:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242657073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:07:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:07:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:07:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553254454] [2025-02-05 22:07:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:07:48,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:07:48,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:07:48,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:07:48,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:07:48,106 INFO L87 Difference]: Start difference. First operand 681 states and 1017 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:07:48,848 INFO L93 Difference]: Finished difference Result 1396 states and 2084 transitions. [2025-02-05 22:07:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:07:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-02-05 22:07:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:07:48,856 INFO L225 Difference]: With dead ends: 1396 [2025-02-05 22:07:48,856 INFO L226 Difference]: Without dead ends: 993 [2025-02-05 22:07:48,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:07:48,859 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 218 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:07:48,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1277 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:07:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-02-05 22:07:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 676. [2025-02-05 22:07:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 532 states have (on average 1.387218045112782) internal successors, (738), 533 states have internal predecessors, (738), 137 states have call successors, (137), 6 states have call predecessors, (137), 6 states have return successors, (137), 136 states have call predecessors, (137), 137 states have call successors, (137) [2025-02-05 22:07:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1012 transitions. [2025-02-05 22:07:48,931 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1012 transitions. Word has length 215 [2025-02-05 22:07:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:07:48,932 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1012 transitions. [2025-02-05 22:07:48,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:07:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1012 transitions. [2025-02-05 22:07:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 22:07:48,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:07:48,934 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:48,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:07:48,935 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:07:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:07:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1814421932, now seen corresponding path program 1 times [2025-02-05 22:07:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:07:48,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290829644] [2025-02-05 22:07:48,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:07:48,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:07:48,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 22:07:49,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 22:07:49,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:07:49,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat