./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 08d675ba4148739e9e7cf1bbda146cfc1e7cae9e235e349f1daedec05eaa7d10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:57:42,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:57:42,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:57:42,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:57:42,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:57:42,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:57:42,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:57:42,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:57:42,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:57:42,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:57:42,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:57:42,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:57:42,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:57:42,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:57:42,608 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:57:42,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:57:42,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:57:42,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:42,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:57:42,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:57:42,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:57:42,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:57:42,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:57:42,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:57:42,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:57:42,610 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/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 -> 08d675ba4148739e9e7cf1bbda146cfc1e7cae9e235e349f1daedec05eaa7d10 [2025-03-08 10:57:42,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:57:42,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:57:42,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:57:42,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:57:42,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:57:42,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-03-08 10:57:44,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff81f3afb/7177f492840545e18130a4b06647e710/FLAGd362d1264 [2025-03-08 10:57:44,316 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:57:44,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-03-08 10:57:44,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff81f3afb/7177f492840545e18130a4b06647e710/FLAGd362d1264 [2025-03-08 10:57:44,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff81f3afb/7177f492840545e18130a4b06647e710 [2025-03-08 10:57:44,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:57:44,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:57:44,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:44,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:57:44,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:57:44,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:44,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44, skipping insertion in model container [2025-03-08 10:57:44,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:44,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:57:44,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i[916,929] [2025-03-08 10:57:44,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:44,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:57:44,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i[916,929] [2025-03-08 10:57:44,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:44,947 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:57:44,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44 WrapperNode [2025-03-08 10:57:44,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:44,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:44,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:57:44,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:57:44,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:44,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,003 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 612 [2025-03-08 10:57:45,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:45,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:57:45,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:57:45,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:57:45,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,058 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-03-08 10:57:45,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:57:45,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:57:45,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:57:45,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:57:45,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (1/1) ... [2025-03-08 10:57:45,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:45,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:57:45,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:57:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:57:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:57:45,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:57:45,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:57:45,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:57:45,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:57:45,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:57:45,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:57:45,941 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:57:45,941 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:57:45,969 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:57:45,971 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 10:57:45,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:45 BoogieIcfgContainer [2025-03-08 10:57:45,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:57:45,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:57:45,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:57:45,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:57:45,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:57:44" (1/3) ... [2025-03-08 10:57:45,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a8da3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:45, skipping insertion in model container [2025-03-08 10:57:45,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:44" (2/3) ... [2025-03-08 10:57:45,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a8da3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:45, skipping insertion in model container [2025-03-08 10:57:45,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:45" (3/3) ... [2025-03-08 10:57:45,979 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-03-08 10:57:45,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:57:45,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-36.i that has 2 procedures, 262 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:57:46,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:57:46,059 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;@14c76c0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:57:46,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:57:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 10:57:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 10:57:46,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:46,082 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:46,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1322637351, now seen corresponding path program 1 times [2025-03-08 10:57:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908220601] [2025-03-08 10:57:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:46,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:46,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:46,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:46,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-08 10:57:46,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:46,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908220601] [2025-03-08 10:57:46,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908220601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754181937] [2025-03-08 10:57:46,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:46,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:46,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:46,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:57:46,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:57:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:46,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:46,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:46,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:46,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:57:46,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-08 10:57:46,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:57:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754181937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:57:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:57:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571086131] [2025-03-08 10:57:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:57:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:47,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:57:47,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:57:47,013 INFO L87 Difference]: Start difference. First operand has 262 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-08 10:57:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:47,064 INFO L93 Difference]: Finished difference Result 514 states and 947 transitions. [2025-03-08 10:57:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:57:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) Word has length 574 [2025-03-08 10:57:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:47,074 INFO L225 Difference]: With dead ends: 514 [2025-03-08 10:57:47,074 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 10:57:47,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 575 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-03-08 10:57:47,079 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:47,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 10:57:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-08 10:57:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 10:57:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2025-03-08 10:57:47,136 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 574 [2025-03-08 10:57:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:47,137 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2025-03-08 10:57:47,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-08 10:57:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2025-03-08 10:57:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 10:57:47,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:47,149 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:47,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:57:47,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:57:47,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -24983932, now seen corresponding path program 1 times [2025-03-08 10:57:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704792607] [2025-03-08 10:57:47,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:47,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:47,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:47,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:47,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:57:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704792607] [2025-03-08 10:57:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704792607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137765430] [2025-03-08 10:57:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:47,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:47,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:47,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:47,834 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:47,923 INFO L93 Difference]: Finished difference Result 657 states and 1078 transitions. [2025-03-08 10:57:47,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:47,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-03-08 10:57:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:47,929 INFO L225 Difference]: With dead ends: 657 [2025-03-08 10:57:47,930 INFO L226 Difference]: Without dead ends: 405 [2025-03-08 10:57:47,930 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-03-08 10:57:47,932 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 208 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:47,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 894 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-08 10:57:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2025-03-08 10:57:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 269 states have (on average 1.479553903345725) internal successors, (398), 270 states have internal predecessors, (398), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 10:57:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 658 transitions. [2025-03-08 10:57:47,981 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 658 transitions. Word has length 574 [2025-03-08 10:57:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:47,982 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 658 transitions. [2025-03-08 10:57:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 658 transitions. [2025-03-08 10:57:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 10:57:47,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:47,987 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:57:47,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:47,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash -535518109, now seen corresponding path program 1 times [2025-03-08 10:57:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034446769] [2025-03-08 10:57:47,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:48,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:48,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:48,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:48,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:57:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034446769] [2025-03-08 10:57:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034446769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:48,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866530279] [2025-03-08 10:57:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:48,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:48,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:48,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:48,599 INFO L87 Difference]: Start difference. First operand 402 states and 658 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:48,683 INFO L93 Difference]: Finished difference Result 1200 states and 1968 transitions. [2025-03-08 10:57:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:48,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-03-08 10:57:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:48,691 INFO L225 Difference]: With dead ends: 1200 [2025-03-08 10:57:48,691 INFO L226 Difference]: Without dead ends: 801 [2025-03-08 10:57:48,693 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-03-08 10:57:48,693 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 234 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:48,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 801 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-08 10:57:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2025-03-08 10:57:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 534 states have (on average 1.4794007490636705) internal successors, (790), 536 states have internal predecessors, (790), 260 states have call successors, (260), 4 states have call predecessors, (260), 4 states have return successors, (260), 258 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 10:57:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1310 transitions. [2025-03-08 10:57:48,785 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1310 transitions. Word has length 574 [2025-03-08 10:57:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:48,789 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1310 transitions. [2025-03-08 10:57:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1310 transitions. [2025-03-08 10:57:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 10:57:48,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:48,793 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:48,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:57:48,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:48,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash -602524862, now seen corresponding path program 1 times [2025-03-08 10:57:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:48,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038268887] [2025-03-08 10:57:48,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:48,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:48,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:48,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:57:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038268887] [2025-03-08 10:57:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038268887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:49,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:57:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292754770] [2025-03-08 10:57:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:49,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:57:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:49,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:57:49,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:57:49,368 INFO L87 Difference]: Start difference. First operand 799 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:49,849 INFO L93 Difference]: Finished difference Result 3023 states and 4975 transitions. [2025-03-08 10:57:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:57:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-03-08 10:57:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:49,863 INFO L225 Difference]: With dead ends: 3023 [2025-03-08 10:57:49,863 INFO L226 Difference]: Without dead ends: 2227 [2025-03-08 10:57:49,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:57:49,867 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 892 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:49,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1577 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:57:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2025-03-08 10:57:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1905. [2025-03-08 10:57:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1384 states have (on average 1.51878612716763) internal successors, (2102), 1394 states have internal predecessors, (2102), 508 states have call successors, (508), 12 states have call predecessors, (508), 12 states have return successors, (508), 498 states have call predecessors, (508), 508 states have call successors, (508) [2025-03-08 10:57:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 3118 transitions. [2025-03-08 10:57:50,021 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 3118 transitions. Word has length 574 [2025-03-08 10:57:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:50,022 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 3118 transitions. [2025-03-08 10:57:50,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 3118 transitions. [2025-03-08 10:57:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 10:57:50,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:50,029 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:57:50,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:50,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1206150241, now seen corresponding path program 1 times [2025-03-08 10:57:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947648956] [2025-03-08 10:57:50,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:50,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:50,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:57:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947648956] [2025-03-08 10:57:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947648956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:57:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405850578] [2025-03-08 10:57:51,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:57:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:51,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:57:51,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:57:51,672 INFO L87 Difference]: Start difference. First operand 1905 states and 3118 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:55,944 INFO L93 Difference]: Finished difference Result 19603 states and 31776 transitions. [2025-03-08 10:57:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 10:57:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-03-08 10:57:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:56,044 INFO L225 Difference]: With dead ends: 19603 [2025-03-08 10:57:56,044 INFO L226 Difference]: Without dead ends: 17701 [2025-03-08 10:57:56,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-03-08 10:57:56,058 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 4025 mSDsluCounter, 3835 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 1141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4025 SdHoareTripleChecker+Valid, 4588 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1141 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:56,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4025 Valid, 4588 Invalid, 3517 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1141 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 10:57:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17701 states. [2025-03-08 10:57:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17701 to 10469. [2025-03-08 10:57:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10469 states, 7574 states have (on average 1.502508581991022) internal successors, (11380), 7646 states have internal predecessors, (11380), 2816 states have call successors, (2816), 78 states have call predecessors, (2816), 78 states have return successors, (2816), 2744 states have call predecessors, (2816), 2816 states have call successors, (2816) [2025-03-08 10:57:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 17012 transitions. [2025-03-08 10:57:56,982 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 17012 transitions. Word has length 574 [2025-03-08 10:57:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:56,985 INFO L471 AbstractCegarLoop]: Abstraction has 10469 states and 17012 transitions. [2025-03-08 10:57:56,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 17012 transitions. [2025-03-08 10:57:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 10:57:56,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:56,999 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:57,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:57:57,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:57,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 744150014, now seen corresponding path program 1 times [2025-03-08 10:57:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:57,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21190097] [2025-03-08 10:57:57,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:57,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 10:57:57,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 10:57:57,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:57,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:57:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:57,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21190097] [2025-03-08 10:57:57,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21190097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:57,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:57,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:57:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234884232] [2025-03-08 10:57:57,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:57,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:57:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:57,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:57:57,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:57,505 INFO L87 Difference]: Start difference. First operand 10469 states and 17012 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:58,127 INFO L93 Difference]: Finished difference Result 21087 states and 34249 transitions. [2025-03-08 10:57:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:57:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-03-08 10:57:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:58,201 INFO L225 Difference]: With dead ends: 21087 [2025-03-08 10:57:58,202 INFO L226 Difference]: Without dead ends: 10621 [2025-03-08 10:57:58,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:58,237 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 0 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:58,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1193 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:58,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2025-03-08 10:57:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 10621. [2025-03-08 10:57:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 7726 states have (on average 1.4926223142635258) internal successors, (11532), 7798 states have internal predecessors, (11532), 2816 states have call successors, (2816), 78 states have call predecessors, (2816), 78 states have return successors, (2816), 2744 states have call predecessors, (2816), 2816 states have call successors, (2816) [2025-03-08 10:57:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 17164 transitions. [2025-03-08 10:57:58,925 INFO L78 Accepts]: Start accepts. Automaton has 10621 states and 17164 transitions. Word has length 574 [2025-03-08 10:57:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:58,926 INFO L471 AbstractCegarLoop]: Abstraction has 10621 states and 17164 transitions. [2025-03-08 10:57:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:57:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10621 states and 17164 transitions. [2025-03-08 10:57:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:57:58,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:58,936 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:57:58,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:57:58,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:58,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1790496837, now seen corresponding path program 1 times [2025-03-08 10:57:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706488718] [2025-03-08 10:57:58,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:58,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:57:59,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:57:59,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:59,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:57:59,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706488718] [2025-03-08 10:57:59,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706488718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:59,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:59,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:57:59,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620568712] [2025-03-08 10:57:59,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:59,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:57:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:59,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:57:59,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:59,501 INFO L87 Difference]: Start difference. First operand 10621 states and 17164 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:00,474 INFO L93 Difference]: Finished difference Result 26297 states and 42583 transitions. [2025-03-08 10:58:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:58:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-03-08 10:58:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:00,538 INFO L225 Difference]: With dead ends: 26297 [2025-03-08 10:58:00,538 INFO L226 Difference]: Without dead ends: 15679 [2025-03-08 10:58:00,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:58:00,571 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 591 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:00,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1032 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:58:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15679 states. [2025-03-08 10:58:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15679 to 10957. [2025-03-08 10:58:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10957 states, 8640 states have (on average 1.5328703703703703) internal successors, (13244), 8694 states have internal predecessors, (13244), 2256 states have call successors, (2256), 60 states have call predecessors, (2256), 60 states have return successors, (2256), 2202 states have call predecessors, (2256), 2256 states have call successors, (2256) [2025-03-08 10:58:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10957 states to 10957 states and 17756 transitions. [2025-03-08 10:58:01,493 INFO L78 Accepts]: Start accepts. Automaton has 10957 states and 17756 transitions. Word has length 576 [2025-03-08 10:58:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:01,494 INFO L471 AbstractCegarLoop]: Abstraction has 10957 states and 17756 transitions. [2025-03-08 10:58:01,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10957 states and 17756 transitions. [2025-03-08 10:58:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:58:01,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:01,507 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:01,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:58:01,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:01,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1259705978, now seen corresponding path program 1 times [2025-03-08 10:58:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:01,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847736758] [2025-03-08 10:58:01,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:01,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:01,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:01,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 96 proven. 177 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-08 10:58:02,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847736758] [2025-03-08 10:58:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847736758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262882195] [2025-03-08 10:58:02,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:02,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:02,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:02,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:58:02,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:02,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:02,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:02,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 10:58:02,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8307 proven. 117 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 10:58:03,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-08 10:58:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262882195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:04,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:04,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 22 [2025-03-08 10:58:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460502109] [2025-03-08 10:58:04,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:04,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 10:58:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:04,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 10:58:04,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-08 10:58:04,315 INFO L87 Difference]: Start difference. First operand 10957 states and 17756 transitions. Second operand has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 22 states have internal predecessors, (301), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 6 states have call predecessors, (276), 6 states have call successors, (276) [2025-03-08 10:58:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:10,531 INFO L93 Difference]: Finished difference Result 23007 states and 37230 transitions. [2025-03-08 10:58:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-08 10:58:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 22 states have internal predecessors, (301), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 6 states have call predecessors, (276), 6 states have call successors, (276) Word has length 576 [2025-03-08 10:58:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:10,616 INFO L225 Difference]: With dead ends: 23007 [2025-03-08 10:58:10,616 INFO L226 Difference]: Without dead ends: 12053 [2025-03-08 10:58:10,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1545, Invalid=7011, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 10:58:10,663 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 6000 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 5898 mSolverCounterSat, 3639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6035 SdHoareTripleChecker+Valid, 5463 SdHoareTripleChecker+Invalid, 9537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3639 IncrementalHoareTripleChecker+Valid, 5898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:10,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6035 Valid, 5463 Invalid, 9537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3639 Valid, 5898 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 10:58:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12053 states. [2025-03-08 10:58:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12053 to 8255. [2025-03-08 10:58:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8255 states, 6154 states have (on average 1.515437114072148) internal successors, (9326), 6198 states have internal predecessors, (9326), 2018 states have call successors, (2018), 82 states have call predecessors, (2018), 82 states have return successors, (2018), 1974 states have call predecessors, (2018), 2018 states have call successors, (2018) [2025-03-08 10:58:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 13362 transitions. [2025-03-08 10:58:11,283 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 13362 transitions. Word has length 576 [2025-03-08 10:58:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:11,284 INFO L471 AbstractCegarLoop]: Abstraction has 8255 states and 13362 transitions. [2025-03-08 10:58:11,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 22 states have internal predecessors, (301), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 6 states have call predecessors, (276), 6 states have call successors, (276) [2025-03-08 10:58:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 13362 transitions. [2025-03-08 10:58:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:58:11,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:11,291 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:11,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:58:11,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 10:58:11,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:11,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1816660906, now seen corresponding path program 1 times [2025-03-08 10:58:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062226690] [2025-03-08 10:58:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:11,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:11,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:11,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:58:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062226690] [2025-03-08 10:58:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062226690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:11,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:11,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:58:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399181226] [2025-03-08 10:58:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:11,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:58:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:11,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:58:11,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:58:11,799 INFO L87 Difference]: Start difference. First operand 8255 states and 13362 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:12,461 INFO L93 Difference]: Finished difference Result 19527 states and 31518 transitions. [2025-03-08 10:58:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:58:12,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-03-08 10:58:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:12,511 INFO L225 Difference]: With dead ends: 19527 [2025-03-08 10:58:12,512 INFO L226 Difference]: Without dead ends: 11275 [2025-03-08 10:58:12,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:58:12,533 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 398 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:12,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 845 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:58:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2025-03-08 10:58:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11249. [2025-03-08 10:58:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11249 states, 8332 states have (on average 1.5036005760921747) internal successors, (12528), 8400 states have internal predecessors, (12528), 2786 states have call successors, (2786), 130 states have call predecessors, (2786), 130 states have return successors, (2786), 2718 states have call predecessors, (2786), 2786 states have call successors, (2786) [2025-03-08 10:58:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11249 states to 11249 states and 18100 transitions. [2025-03-08 10:58:13,574 INFO L78 Accepts]: Start accepts. Automaton has 11249 states and 18100 transitions. Word has length 576 [2025-03-08 10:58:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:13,575 INFO L471 AbstractCegarLoop]: Abstraction has 11249 states and 18100 transitions. [2025-03-08 10:58:13,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 11249 states and 18100 transitions. [2025-03-08 10:58:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:58:13,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:13,587 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:13,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:58:13,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:13,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1553256647, now seen corresponding path program 1 times [2025-03-08 10:58:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:13,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771663296] [2025-03-08 10:58:13,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:13,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:13,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:13,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:13,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:58:14,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:14,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771663296] [2025-03-08 10:58:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771663296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:58:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604286970] [2025-03-08 10:58:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:14,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:58:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:14,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:58:14,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:58:14,609 INFO L87 Difference]: Start difference. First operand 11249 states and 18100 transitions. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-08 10:58:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:18,932 INFO L93 Difference]: Finished difference Result 48123 states and 76890 transitions. [2025-03-08 10:58:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:58:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) Word has length 576 [2025-03-08 10:58:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:19,076 INFO L225 Difference]: With dead ends: 48123 [2025-03-08 10:58:19,076 INFO L226 Difference]: Without dead ends: 36877 [2025-03-08 10:58:19,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:58:19,117 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 2385 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 937 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 937 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:19,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 2643 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [937 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 10:58:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36877 states. [2025-03-08 10:58:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36877 to 17927. [2025-03-08 10:58:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17927 states, 13274 states have (on average 1.4887750489679072) internal successors, (19762), 13382 states have internal predecessors, (19762), 4354 states have call successors, (4354), 298 states have call predecessors, (4354), 298 states have return successors, (4354), 4246 states have call predecessors, (4354), 4354 states have call successors, (4354) [2025-03-08 10:58:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17927 states to 17927 states and 28470 transitions. [2025-03-08 10:58:20,970 INFO L78 Accepts]: Start accepts. Automaton has 17927 states and 28470 transitions. Word has length 576 [2025-03-08 10:58:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:20,971 INFO L471 AbstractCegarLoop]: Abstraction has 17927 states and 28470 transitions. [2025-03-08 10:58:20,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-08 10:58:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 17927 states and 28470 transitions. [2025-03-08 10:58:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:58:20,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:20,982 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:58:20,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1108906650, now seen corresponding path program 1 times [2025-03-08 10:58:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907485602] [2025-03-08 10:58:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:21,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:21,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:58:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907485602] [2025-03-08 10:58:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907485602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:21,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:58:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479272259] [2025-03-08 10:58:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:21,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:58:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:21,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:58:21,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:58:21,488 INFO L87 Difference]: Start difference. First operand 17927 states and 28470 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:24,743 INFO L93 Difference]: Finished difference Result 42511 states and 67923 transitions. [2025-03-08 10:58:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:58:24,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-03-08 10:58:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:24,833 INFO L225 Difference]: With dead ends: 42511 [2025-03-08 10:58:24,833 INFO L226 Difference]: Without dead ends: 24583 [2025-03-08 10:58:24,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:58:24,878 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 808 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:24,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2334 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:58:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24583 states. [2025-03-08 10:58:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24583 to 11237. [2025-03-08 10:58:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11237 states, 8610 states have (on average 1.516608594657375) internal successors, (13058), 8670 states have internal predecessors, (13058), 2452 states have call successors, (2452), 174 states have call predecessors, (2452), 174 states have return successors, (2452), 2392 states have call predecessors, (2452), 2452 states have call successors, (2452) [2025-03-08 10:58:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11237 states to 11237 states and 17962 transitions. [2025-03-08 10:58:25,923 INFO L78 Accepts]: Start accepts. Automaton has 11237 states and 17962 transitions. Word has length 576 [2025-03-08 10:58:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:25,924 INFO L471 AbstractCegarLoop]: Abstraction has 11237 states and 17962 transitions. [2025-03-08 10:58:25,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11237 states and 17962 transitions. [2025-03-08 10:58:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:58:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:25,932 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:25,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:58:25,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1784913685, now seen corresponding path program 1 times [2025-03-08 10:58:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823329332] [2025-03-08 10:58:25,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:25,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:26,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:26,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:26,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-08 10:58:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823329332] [2025-03-08 10:58:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823329332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598915521] [2025-03-08 10:58:26,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:26,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:26,717 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:26,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:58:26,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:26,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:58:26,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7407 proven. 87 refuted. 0 times theorem prover too weak. 9250 trivial. 0 not checked. [2025-03-08 10:58:27,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 186 proven. 87 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-08 10:58:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598915521] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:27,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-03-08 10:58:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678426591] [2025-03-08 10:58:27,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:58:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:27,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:58:27,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:58:27,529 INFO L87 Difference]: Start difference. First operand 11237 states and 17962 transitions. Second operand has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) [2025-03-08 10:58:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:33,185 INFO L93 Difference]: Finished difference Result 50055 states and 78463 transitions. [2025-03-08 10:58:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 10:58:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) Word has length 576 [2025-03-08 10:58:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:33,305 INFO L225 Difference]: With dead ends: 50055 [2025-03-08 10:58:33,305 INFO L226 Difference]: Without dead ends: 38821 [2025-03-08 10:58:33,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1150 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=537, Invalid=1625, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 10:58:33,339 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1595 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:33,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 2515 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 10:58:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38821 states. [2025-03-08 10:58:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38821 to 20747. [2025-03-08 10:58:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20747 states, 16264 states have (on average 1.5033202164289228) internal successors, (24450), 16372 states have internal predecessors, (24450), 4170 states have call successors, (4170), 312 states have call predecessors, (4170), 312 states have return successors, (4170), 4062 states have call predecessors, (4170), 4170 states have call successors, (4170) [2025-03-08 10:58:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20747 states to 20747 states and 32790 transitions. [2025-03-08 10:58:35,403 INFO L78 Accepts]: Start accepts. Automaton has 20747 states and 32790 transitions. Word has length 576 [2025-03-08 10:58:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 20747 states and 32790 transitions. [2025-03-08 10:58:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) [2025-03-08 10:58:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 32790 transitions. [2025-03-08 10:58:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 10:58:35,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:35,415 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:35,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 10:58:35,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:35,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:35,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:35,617 INFO L85 PathProgramCache]: Analyzing trace with hash -152109686, now seen corresponding path program 1 times [2025-03-08 10:58:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050101727] [2025-03-08 10:58:35,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:35,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:35,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:35,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:35,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-08 10:58:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050101727] [2025-03-08 10:58:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050101727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810619577] [2025-03-08 10:58:36,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:36,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:36,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:36,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:36,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 10:58:36,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 10:58:36,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 10:58:36,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:36,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:36,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:58:36,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7761 proven. 96 refuted. 0 times theorem prover too weak. 8887 trivial. 0 not checked. [2025-03-08 10:58:36,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-08 10:58:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810619577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:37,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-03-08 10:58:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047892590] [2025-03-08 10:58:37,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:37,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:58:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:37,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:58:37,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:58:37,440 INFO L87 Difference]: Start difference. First operand 20747 states and 32790 transitions. Second operand has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) [2025-03-08 10:58:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:40,745 INFO L93 Difference]: Finished difference Result 47055 states and 74476 transitions. [2025-03-08 10:58:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:58:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) Word has length 576 [2025-03-08 10:58:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:40,829 INFO L225 Difference]: With dead ends: 47055 [2025-03-08 10:58:40,829 INFO L226 Difference]: Without dead ends: 26311 [2025-03-08 10:58:40,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1143 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-08 10:58:40,863 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 859 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:40,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 2958 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:58:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2025-03-08 10:58:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 18031. [2025-03-08 10:58:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 14006 states have (on average 1.4976438669141796) internal successors, (20976), 14102 states have internal predecessors, (20976), 3742 states have call successors, (3742), 282 states have call predecessors, (3742), 282 states have return successors, (3742), 3646 states have call predecessors, (3742), 3742 states have call successors, (3742) [2025-03-08 10:58:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 28460 transitions. [2025-03-08 10:58:43,129 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 28460 transitions. Word has length 576 [2025-03-08 10:58:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:43,129 INFO L471 AbstractCegarLoop]: Abstraction has 18031 states and 28460 transitions. [2025-03-08 10:58:43,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) [2025-03-08 10:58:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 28460 transitions. [2025-03-08 10:58:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 10:58:43,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:43,140 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:43,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 10:58:43,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:43,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:43,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1434266578, now seen corresponding path program 1 times [2025-03-08 10:58:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:43,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016239479] [2025-03-08 10:58:43,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:43,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 10:58:43,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 10:58:43,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:43,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-08 10:58:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016239479] [2025-03-08 10:58:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016239479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:58:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700542430] [2025-03-08 10:58:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:58:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:43,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:58:43,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:58:43,752 INFO L87 Difference]: Start difference. First operand 18031 states and 28460 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:50,954 INFO L93 Difference]: Finished difference Result 81157 states and 127964 transitions. [2025-03-08 10:58:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:58:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 577 [2025-03-08 10:58:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:51,146 INFO L225 Difference]: With dead ends: 81157 [2025-03-08 10:58:51,147 INFO L226 Difference]: Without dead ends: 72379 [2025-03-08 10:58:51,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:58:51,180 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 1695 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:51,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 2535 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:58:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72379 states. [2025-03-08 10:58:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72379 to 54071. [2025-03-08 10:58:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54071 states, 42574 states have (on average 1.4980504533283225) internal successors, (63778), 42870 states have internal predecessors, (63778), 10716 states have call successors, (10716), 780 states have call predecessors, (10716), 780 states have return successors, (10716), 10420 states have call predecessors, (10716), 10716 states have call successors, (10716) [2025-03-08 10:58:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54071 states to 54071 states and 85210 transitions. [2025-03-08 10:58:57,022 INFO L78 Accepts]: Start accepts. Automaton has 54071 states and 85210 transitions. Word has length 577 [2025-03-08 10:58:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:57,022 INFO L471 AbstractCegarLoop]: Abstraction has 54071 states and 85210 transitions. [2025-03-08 10:58:57,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-08 10:58:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 54071 states and 85210 transitions. [2025-03-08 10:58:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 10:58:57,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:57,043 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 10:58:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:58:57,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1561020138, now seen corresponding path program 1 times [2025-03-08 10:58:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841090579] [2025-03-08 10:58:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:57,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 10:58:57,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 10:58:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:58:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937336088] [2025-03-08 10:58:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:57,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:57,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:57,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 10:58:57,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 10:58:57,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 10:58:57,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:57,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:57,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 10:58:57,431 INFO L279 TraceCheckSpWp]: Computing forward predicates...