./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-7.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 2f6d916e6c89ec0501f19a73e0a38be6009da7e6b48af484d64bc97b2cd19177 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:48:41,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:48:41,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:48:41,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:48:41,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:48:41,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:48:41,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:48:41,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:48:41,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:48:41,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:48:41,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:48:41,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:48:41,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:48:41,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:48:41,384 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:48:41,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:48:41,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:48:41,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:48:41,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:48:41,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:48:41,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:48:41,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:48:41,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:48:41,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:48:41,387 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 -> 2f6d916e6c89ec0501f19a73e0a38be6009da7e6b48af484d64bc97b2cd19177 [2025-02-05 22:48:41,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:48:41,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:48:41,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:48:41,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:48:41,606 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:48:41,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i [2025-02-05 22:48:42,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67d66f856/8128d4d7724b46da8f64e6fe72f9fab3/FLAGa0c7e044c [2025-02-05 22:48:43,143 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:48:43,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i [2025-02-05 22:48:43,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67d66f856/8128d4d7724b46da8f64e6fe72f9fab3/FLAGa0c7e044c [2025-02-05 22:48:43,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67d66f856/8128d4d7724b46da8f64e6fe72f9fab3 [2025-02-05 22:48:43,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:48:43,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:48:43,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:48:43,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:48:43,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:48:43,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648a25d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43, skipping insertion in model container [2025-02-05 22:48:43,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:48:43,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i[918,931] [2025-02-05 22:48:43,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:48:43,387 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:48:43,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i[918,931] [2025-02-05 22:48:43,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:48:43,459 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:48:43,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43 WrapperNode [2025-02-05 22:48:43,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:48:43,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:48:43,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:48:43,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:48:43,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,514 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2025-02-05 22:48:43,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:48:43,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:48:43,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:48:43,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:48:43,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,547 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:48:43,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:48:43,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:48:43,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:48:43,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:48:43,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (1/1) ... [2025-02-05 22:48:43,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:48:43,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:48:43,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:48:43,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:48:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:48:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:48:43,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:48:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:48:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:48:43,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:48:43,688 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:48:43,690 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:48:44,106 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 22:48:44,108 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:48:44,126 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:48:44,126 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:48:44,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:48:44 BoogieIcfgContainer [2025-02-05 22:48:44,127 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:48:44,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:48:44,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:48:44,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:48:44,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:48:43" (1/3) ... [2025-02-05 22:48:44,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487dd450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:48:44, skipping insertion in model container [2025-02-05 22:48:44,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:43" (2/3) ... [2025-02-05 22:48:44,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487dd450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:48:44, skipping insertion in model container [2025-02-05 22:48:44,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:48:44" (3/3) ... [2025-02-05 22:48:44,135 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i [2025-02-05 22:48:44,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:48:44,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-7.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:48:44,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:48:44,205 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;@2bb15561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:48:44,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:48:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 86 states have (on average 1.430232558139535) internal successors, (123), 87 states have internal predecessors, (123), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 22:48:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 22:48:44,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:44,226 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:44,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:44,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2056078472, now seen corresponding path program 1 times [2025-02-05 22:48:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211073871] [2025-02-05 22:48:44,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 22:48:44,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 22:48:44,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:44,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-02-05 22:48:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211073871] [2025-02-05 22:48:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211073871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:48:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959682712] [2025-02-05 22:48:44,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:44,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:48:44,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:48:44,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:48:44,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:48:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 22:48:44,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 22:48:44,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:44,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:48:44,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:48:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-02-05 22:48:44,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:48:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959682712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:48:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:48:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325985755] [2025-02-05 22:48:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:44,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:48:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:44,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:48:44,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:48:44,840 INFO L87 Difference]: Start difference. First operand has 124 states, 86 states have (on average 1.430232558139535) internal successors, (123), 87 states have internal predecessors, (123), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-05 22:48:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:44,882 INFO L93 Difference]: Finished difference Result 237 states and 409 transitions. [2025-02-05 22:48:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:48:44,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 230 [2025-02-05 22:48:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:44,889 INFO L225 Difference]: With dead ends: 237 [2025-02-05 22:48:44,890 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 22:48:44,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:48:44,895 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:44,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:48:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 22:48:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-05 22:48:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 22:48:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2025-02-05 22:48:44,926 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 230 [2025-02-05 22:48:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:44,926 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2025-02-05 22:48:44,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-05 22:48:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2025-02-05 22:48:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 22:48:44,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:44,929 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:44,936 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:48:45,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:48:45,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:45,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1421778862, now seen corresponding path program 1 times [2025-02-05 22:48:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358390435] [2025-02-05 22:48:45,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:45,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 22:48:45,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 22:48:45,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:45,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358390435] [2025-02-05 22:48:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358390435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:48:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780844420] [2025-02-05 22:48:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:45,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:48:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:45,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:48:45,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:48:45,498 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:45,539 INFO L93 Difference]: Finished difference Result 230 states and 357 transitions. [2025-02-05 22:48:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:48:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 230 [2025-02-05 22:48:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:45,542 INFO L225 Difference]: With dead ends: 230 [2025-02-05 22:48:45,542 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 22:48:45,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:48:45,543 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:45,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:48:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 22:48:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-05 22:48:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 22:48:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2025-02-05 22:48:45,553 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 230 [2025-02-05 22:48:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2025-02-05 22:48:45,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2025-02-05 22:48:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-05 22:48:45,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:45,556 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:45,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:48:45,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:45,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1985969164, now seen corresponding path program 1 times [2025-02-05 22:48:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431128365] [2025-02-05 22:48:45,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:45,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 22:48:45,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 22:48:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:45,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431128365] [2025-02-05 22:48:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431128365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:48:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809620515] [2025-02-05 22:48:45,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:48:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:45,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:48:45,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:48:45,724 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:45,770 INFO L93 Difference]: Finished difference Result 232 states and 359 transitions. [2025-02-05 22:48:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:48:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 231 [2025-02-05 22:48:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:45,776 INFO L225 Difference]: With dead ends: 232 [2025-02-05 22:48:45,776 INFO L226 Difference]: Without dead ends: 118 [2025-02-05 22:48:45,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:48:45,777 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:45,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:48:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-05 22:48:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-02-05 22:48:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 22:48:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2025-02-05 22:48:45,793 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 231 [2025-02-05 22:48:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:45,794 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2025-02-05 22:48:45,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2025-02-05 22:48:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-05 22:48:45,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:45,799 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:45,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:48:45,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:45,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 125789647, now seen corresponding path program 1 times [2025-02-05 22:48:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:45,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631162085] [2025-02-05 22:48:45,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:45,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 22:48:45,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 22:48:45,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:45,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:47,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631162085] [2025-02-05 22:48:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631162085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:48:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11289343] [2025-02-05 22:48:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:47,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:48:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:47,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:48:47,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:48:47,009 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:48,178 INFO L93 Difference]: Finished difference Result 419 states and 644 transitions. [2025-02-05 22:48:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:48:48,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 231 [2025-02-05 22:48:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:48,182 INFO L225 Difference]: With dead ends: 419 [2025-02-05 22:48:48,184 INFO L226 Difference]: Without dead ends: 305 [2025-02-05 22:48:48,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:48:48,185 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 361 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:48,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1634 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:48:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-05 22:48:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 248. [2025-02-05 22:48:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 181 states have (on average 1.3867403314917126) internal successors, (251), 183 states have internal predecessors, (251), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:48:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2025-02-05 22:48:48,209 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 231 [2025-02-05 22:48:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:48,209 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2025-02-05 22:48:48,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2025-02-05 22:48:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 22:48:48,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:48,214 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:48:48,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 549056508, now seen corresponding path program 1 times [2025-02-05 22:48:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570505000] [2025-02-05 22:48:48,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 22:48:48,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 22:48:48,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:48,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:48,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570505000] [2025-02-05 22:48:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570505000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:48:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963717303] [2025-02-05 22:48:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:48,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:48:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:48,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:48:48,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:48:48,944 INFO L87 Difference]: Start difference. First operand 248 states and 375 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:49,413 INFO L93 Difference]: Finished difference Result 592 states and 892 transitions. [2025-02-05 22:48:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:48:49,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 232 [2025-02-05 22:48:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:49,420 INFO L225 Difference]: With dead ends: 592 [2025-02-05 22:48:49,420 INFO L226 Difference]: Without dead ends: 347 [2025-02-05 22:48:49,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:48:49,421 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 320 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:49,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 775 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:48:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-05 22:48:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 204. [2025-02-05 22:48:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 139 states have internal predecessors, (179), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:48:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 303 transitions. [2025-02-05 22:48:49,453 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 303 transitions. Word has length 232 [2025-02-05 22:48:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 303 transitions. [2025-02-05 22:48:49,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 303 transitions. [2025-02-05 22:48:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 22:48:49,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:49,455 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:48:49,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1880284350, now seen corresponding path program 1 times [2025-02-05 22:48:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620066891] [2025-02-05 22:48:49,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:49,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 22:48:49,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 22:48:49,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:49,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620066891] [2025-02-05 22:48:50,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620066891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:50,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:50,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:48:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815920540] [2025-02-05 22:48:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:48:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:50,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:48:50,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:48:50,799 INFO L87 Difference]: Start difference. First operand 204 states and 303 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-02-05 22:48:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:51,814 INFO L93 Difference]: Finished difference Result 675 states and 984 transitions. [2025-02-05 22:48:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:48:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 232 [2025-02-05 22:48:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:51,818 INFO L225 Difference]: With dead ends: 675 [2025-02-05 22:48:51,818 INFO L226 Difference]: Without dead ends: 481 [2025-02-05 22:48:51,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:48:51,819 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 576 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:51,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 471 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:48:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-05 22:48:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 382. [2025-02-05 22:48:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 272 states have (on average 1.3345588235294117) internal successors, (363), 276 states have internal predecessors, (363), 98 states have call successors, (98), 11 states have call predecessors, (98), 11 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 22:48:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 559 transitions. [2025-02-05 22:48:51,903 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 559 transitions. Word has length 232 [2025-02-05 22:48:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 559 transitions. [2025-02-05 22:48:51,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-02-05 22:48:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 559 transitions. [2025-02-05 22:48:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 22:48:51,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:51,906 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:51,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:48:51,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 392550341, now seen corresponding path program 1 times [2025-02-05 22:48:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044192120] [2025-02-05 22:48:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:51,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 22:48:51,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 22:48:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044192120] [2025-02-05 22:48:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044192120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:51,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:51,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:48:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451613593] [2025-02-05 22:48:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:51,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:48:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:51,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:48:51,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:48:51,995 INFO L87 Difference]: Start difference. First operand 382 states and 559 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:52,104 INFO L93 Difference]: Finished difference Result 1013 states and 1478 transitions. [2025-02-05 22:48:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:48:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 232 [2025-02-05 22:48:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:52,109 INFO L225 Difference]: With dead ends: 1013 [2025-02-05 22:48:52,109 INFO L226 Difference]: Without dead ends: 660 [2025-02-05 22:48:52,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:48:52,110 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 161 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:52,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 371 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:48:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-02-05 22:48:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 657. [2025-02-05 22:48:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 452 states have (on average 1.2876106194690264) internal successors, (582), 459 states have internal predecessors, (582), 183 states have call successors, (183), 21 states have call predecessors, (183), 21 states have return successors, (183), 176 states have call predecessors, (183), 183 states have call successors, (183) [2025-02-05 22:48:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 948 transitions. [2025-02-05 22:48:52,239 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 948 transitions. Word has length 232 [2025-02-05 22:48:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:52,239 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 948 transitions. [2025-02-05 22:48:52,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 948 transitions. [2025-02-05 22:48:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 22:48:52,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:52,242 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:48:52,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:52,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 134934503, now seen corresponding path program 1 times [2025-02-05 22:48:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:52,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888144610] [2025-02-05 22:48:52,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:52,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 22:48:52,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 22:48:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-02-05 22:48:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888144610] [2025-02-05 22:48:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888144610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:48:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:48:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:48:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513402889] [2025-02-05 22:48:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:48:52,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:48:52,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:52,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:48:52,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:48:52,482 INFO L87 Difference]: Start difference. First operand 657 states and 948 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:48:53,153 INFO L93 Difference]: Finished difference Result 1488 states and 2147 transitions. [2025-02-05 22:48:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:48:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 233 [2025-02-05 22:48:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:48:53,163 INFO L225 Difference]: With dead ends: 1488 [2025-02-05 22:48:53,164 INFO L226 Difference]: Without dead ends: 860 [2025-02-05 22:48:53,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:48:53,166 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 452 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:48:53,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1009 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:48:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-02-05 22:48:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 745. [2025-02-05 22:48:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 516 states have (on average 1.2810077519379846) internal successors, (661), 523 states have internal predecessors, (661), 205 states have call successors, (205), 23 states have call predecessors, (205), 23 states have return successors, (205), 198 states have call predecessors, (205), 205 states have call successors, (205) [2025-02-05 22:48:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1071 transitions. [2025-02-05 22:48:53,301 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1071 transitions. Word has length 233 [2025-02-05 22:48:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:48:53,302 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1071 transitions. [2025-02-05 22:48:53,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-02-05 22:48:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1071 transitions. [2025-02-05 22:48:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 22:48:53,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:48:53,306 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:48:53,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:48:53,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:48:53,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:48:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash 163563654, now seen corresponding path program 1 times [2025-02-05 22:48:53,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:48:53,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124920972] [2025-02-05 22:48:53,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:48:53,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 22:48:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 22:48:53,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 99 proven. 99 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-02-05 22:48:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:48:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124920972] [2025-02-05 22:48:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124920972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:48:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013460779] [2025-02-05 22:48:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:48:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:48:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:48:54,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:48:54,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:48:54,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 22:48:54,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 22:48:54,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:48:54,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:48:54,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 22:48:54,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:48:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1422 proven. 186 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2025-02-05 22:48:58,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:48:59,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013460779] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:48:59,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:48:59,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 25 [2025-02-05 22:48:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607962164] [2025-02-05 22:48:59,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:48:59,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 22:48:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:48:59,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 22:48:59,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=919, Unknown=1, NotChecked=0, Total=1056 [2025-02-05 22:48:59,912 INFO L87 Difference]: Start difference. First operand 745 states and 1071 transitions. Second operand has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 6 states have call successors, (57), 4 states have call predecessors, (57), 7 states have return successors, (58), 6 states have call predecessors, (58), 6 states have call successors, (58) [2025-02-05 22:49:13,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:49:15,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:49:24,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:49:33,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:49:34,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:49:56,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:49:58,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:03,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:05,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:08,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:09,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:11,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:13,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:15,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:50:17,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]