./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-10_file-52.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 e36708b959d2766ccb3dd17186f87fc0beb353908e35aa36052ba70a089a0487 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:55:44,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:55:44,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:55:44,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:55:44,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:55:45,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:55:45,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:55:45,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:55:45,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:55:45,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:55:45,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:55:45,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:55:45,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:55:45,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:55:45,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:55:45,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:55:45,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:55:45,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:55:45,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:45,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:55:45,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:55:45,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:55:45,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:55:45,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:55:45,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:55:45,005 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 -> e36708b959d2766ccb3dd17186f87fc0beb353908e35aa36052ba70a089a0487 [2025-03-16 23:55:45,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:55:45,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:55:45,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:55:45,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:55:45,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:55:45,240 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-10_file-52.i [2025-03-16 23:55:46,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41a0620f/61e0a5db2aaf4c12b5c89a8d5bb24aa7/FLAGaebeb915a [2025-03-16 23:55:46,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:55:46,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-52.i [2025-03-16 23:55:46,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41a0620f/61e0a5db2aaf4c12b5c89a8d5bb24aa7/FLAGaebeb915a [2025-03-16 23:55:46,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41a0620f/61e0a5db2aaf4c12b5c89a8d5bb24aa7 [2025-03-16 23:55:46,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:55:46,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:55:46,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:46,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:55:46,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:55:46,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:46" (1/1) ... [2025-03-16 23:55:46,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2035306c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:46, skipping insertion in model container [2025-03-16 23:55:46,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:46" (1/1) ... [2025-03-16 23:55:46,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:55:47,025 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-10_file-52.i[915,928] [2025-03-16 23:55:47,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:47,098 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:55:47,107 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-10_file-52.i[915,928] [2025-03-16 23:55:47,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:47,158 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:55:47,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47 WrapperNode [2025-03-16 23:55:47,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:47,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:47,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:55:47,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:55:47,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,198 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-16 23:55:47,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:47,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:55:47,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:55:47,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:55:47,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,220 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-16 23:55:47,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:55:47,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:55:47,233 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:55:47,233 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:55:47,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (1/1) ... [2025-03-16 23:55:47,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:47,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:47,257 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-16 23:55:47,262 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-16 23:55:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:55:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:55:47,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:55:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:55:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:55:47,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:55:47,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:55:47,344 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:55:47,572 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 23:55:47,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:55:47,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:55:47,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:55:47,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:47 BoogieIcfgContainer [2025-03-16 23:55:47,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:55:47,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:55:47,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:55:47,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:55:47,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:55:46" (1/3) ... [2025-03-16 23:55:47,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cefdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:47, skipping insertion in model container [2025-03-16 23:55:47,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:47" (2/3) ... [2025-03-16 23:55:47,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cefdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:47, skipping insertion in model container [2025-03-16 23:55:47,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:47" (3/3) ... [2025-03-16 23:55:47,592 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-52.i [2025-03-16 23:55:47,602 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:55:47,604 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-52.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:55:47,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:55:47,652 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;@7b3da202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:55:47,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:55:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 23:55:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:55:47,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:47,662 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:55:47,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:47,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -474439399, now seen corresponding path program 1 times [2025-03-16 23:55:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:47,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387014429] [2025-03-16 23:55:47,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:47,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:55:47,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:55:47,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:47,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 23:55:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387014429] [2025-03-16 23:55:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387014429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:47,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340152611] [2025-03-16 23:55:47,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:47,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:47,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:47,927 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-16 23:55:47,929 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-16 23:55:47,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:55:48,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:55:48,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:48,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:48,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:55:48,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 23:55:48,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:55:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340152611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:55:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:55:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374538771] [2025-03-16 23:55:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:48,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:55:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:48,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:55:48,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:55:48,100 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:55:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:48,122 INFO L93 Difference]: Finished difference Result 123 states and 213 transitions. [2025-03-16 23:55:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:55:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-16 23:55:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:48,129 INFO L225 Difference]: With dead ends: 123 [2025-03-16 23:55:48,129 INFO L226 Difference]: Without dead ends: 61 [2025-03-16 23:55:48,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-16 23:55:48,135 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:48,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:55:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-16 23:55:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-16 23:55:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 23:55:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-16 23:55:48,192 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 134 [2025-03-16 23:55:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:48,192 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-16 23:55:48,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 23:55:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-16 23:55:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:55:48,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:48,195 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:55:48,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:55:48,395 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-16 23:55:48,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1621183206, now seen corresponding path program 1 times [2025-03-16 23:55:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:48,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328590807] [2025-03-16 23:55:48,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:48,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:55:48,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:55:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:55:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328590807] [2025-03-16 23:55:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328590807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:55:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368138362] [2025-03-16 23:55:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:55:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:54,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:55:54,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:55:54,058 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-16 23:55:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:56,990 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2025-03-16 23:55:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 23:55:56,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 134 [2025-03-16 23:55:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:56,993 INFO L225 Difference]: With dead ends: 186 [2025-03-16 23:55:56,993 INFO L226 Difference]: Without dead ends: 184 [2025-03-16 23:55:56,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2025-03-16 23:55:56,994 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 327 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:56,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 493 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:55:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-16 23:55:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2025-03-16 23:55:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 23:55:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2025-03-16 23:55:57,023 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 134 [2025-03-16 23:55:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:57,024 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2025-03-16 23:55:57,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-16 23:55:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2025-03-16 23:55:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:55:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:57,026 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:55:57,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:55:57,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1817696711, now seen corresponding path program 1 times [2025-03-16 23:55:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:57,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883408075] [2025-03-16 23:55:57,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:57,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:55:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:55:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:55:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883408075] [2025-03-16 23:55:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883408075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:57,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:55:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653390601] [2025-03-16 23:55:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:57,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:55:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:57,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:55:57,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:57,152 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:55:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:57,247 INFO L93 Difference]: Finished difference Result 277 states and 427 transitions. [2025-03-16 23:55:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:55:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2025-03-16 23:55:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:57,250 INFO L225 Difference]: With dead ends: 277 [2025-03-16 23:55:57,250 INFO L226 Difference]: Without dead ends: 204 [2025-03-16 23:55:57,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:55:57,253 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 107 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:57,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 349 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:55:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-16 23:55:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 131. [2025-03-16 23:55:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 23:55:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2025-03-16 23:55:57,276 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 134 [2025-03-16 23:55:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:57,277 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2025-03-16 23:55:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:55:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2025-03-16 23:55:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:55:57,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:57,280 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:55:57,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:55:57,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:57,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash 483805721, now seen corresponding path program 1 times [2025-03-16 23:55:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787567307] [2025-03-16 23:55:57,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:57,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:55:57,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:55:57,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:56:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:56:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787567307] [2025-03-16 23:56:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787567307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:00,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:56:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955930350] [2025-03-16 23:56:00,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:00,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:56:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:56:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:56:00,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:56:00,683 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:56:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:01,130 INFO L93 Difference]: Finished difference Result 335 states and 501 transitions. [2025-03-16 23:56:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:56:01,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2025-03-16 23:56:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:01,133 INFO L225 Difference]: With dead ends: 335 [2025-03-16 23:56:01,134 INFO L226 Difference]: Without dead ends: 259 [2025-03-16 23:56:01,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:56:01,135 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 191 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:01,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 509 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:56:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-16 23:56:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 219. [2025-03-16 23:56:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 145 states have internal predecessors, (188), 69 states have call successors, (69), 5 states have call predecessors, (69), 5 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 23:56:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 326 transitions. [2025-03-16 23:56:01,169 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 326 transitions. Word has length 134 [2025-03-16 23:56:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:01,169 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 326 transitions. [2025-03-16 23:56:01,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:56:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2025-03-16 23:56:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 23:56:01,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:01,173 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:56:01,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:56:01,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:01,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1914586213, now seen corresponding path program 1 times [2025-03-16 23:56:01,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:56:01,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700388146] [2025-03-16 23:56:01,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:56:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 23:56:01,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 23:56:01,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:01,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:56:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:56:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700388146] [2025-03-16 23:56:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700388146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:56:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742690999] [2025-03-16 23:56:01,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:01,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:56:01,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:56:01,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:56:01,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:56:01,242 INFO L87 Difference]: Start difference. First operand 219 states and 326 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:56:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:01,344 INFO L93 Difference]: Finished difference Result 304 states and 451 transitions. [2025-03-16 23:56:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:56:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2025-03-16 23:56:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:01,348 INFO L225 Difference]: With dead ends: 304 [2025-03-16 23:56:01,349 INFO L226 Difference]: Without dead ends: 158 [2025-03-16 23:56:01,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:56:01,351 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:01,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 121 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:56:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-16 23:56:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-16 23:56:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.2571428571428571) internal successors, (132), 106 states have internal predecessors, (132), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 23:56:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2025-03-16 23:56:01,372 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 134 [2025-03-16 23:56:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:01,372 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2025-03-16 23:56:01,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 23:56:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2025-03-16 23:56:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 23:56:01,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:01,374 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:56:01,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:56:01,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:01,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1543971784, now seen corresponding path program 1 times [2025-03-16 23:56:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:56:01,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115024576] [2025-03-16 23:56:01,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:56:01,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 23:56:01,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 23:56:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:01,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:56:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:56:03,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115024576] [2025-03-16 23:56:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115024576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:03,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:03,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:56:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487042674] [2025-03-16 23:56:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:03,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:56:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:56:03,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:56:03,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:56:03,959 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-16 23:56:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:05,208 INFO L93 Difference]: Finished difference Result 280 states and 397 transitions. [2025-03-16 23:56:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:56:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 135 [2025-03-16 23:56:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:05,211 INFO L225 Difference]: With dead ends: 280 [2025-03-16 23:56:05,211 INFO L226 Difference]: Without dead ends: 190 [2025-03-16 23:56:05,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2025-03-16 23:56:05,213 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 169 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:05,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 619 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:56:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-16 23:56:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 155. [2025-03-16 23:56:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 23:56:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 222 transitions. [2025-03-16 23:56:05,224 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 222 transitions. Word has length 135 [2025-03-16 23:56:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 222 transitions. [2025-03-16 23:56:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-16 23:56:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 222 transitions. [2025-03-16 23:56:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 23:56:05,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:05,226 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:56:05,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:56:05,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1285760267, now seen corresponding path program 1 times [2025-03-16 23:56:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:56:05,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266059876] [2025-03-16 23:56:05,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:56:05,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 23:56:05,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 23:56:05,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:05,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:56:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:56:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266059876] [2025-03-16 23:56:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266059876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:07,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:07,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:56:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898734630] [2025-03-16 23:56:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:07,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:56:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:56:07,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:56:07,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:56:07,244 INFO L87 Difference]: Start difference. First operand 155 states and 222 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-16 23:56:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:08,192 INFO L93 Difference]: Finished difference Result 266 states and 378 transitions. [2025-03-16 23:56:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:56:08,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 135 [2025-03-16 23:56:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:08,194 INFO L225 Difference]: With dead ends: 266 [2025-03-16 23:56:08,194 INFO L226 Difference]: Without dead ends: 179 [2025-03-16 23:56:08,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2025-03-16 23:56:08,195 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 217 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:08,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 457 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:56:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-16 23:56:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2025-03-16 23:56:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 107 states have (on average 1.233644859813084) internal successors, (132), 108 states have internal predecessors, (132), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 23:56:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 228 transitions. [2025-03-16 23:56:08,209 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 228 transitions. Word has length 135 [2025-03-16 23:56:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:08,209 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 228 transitions. [2025-03-16 23:56:08,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-16 23:56:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 228 transitions. [2025-03-16 23:56:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 23:56:08,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:08,211 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:56:08,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:56:08,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:08,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash 318956205, now seen corresponding path program 1 times [2025-03-16 23:56:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:56:08,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019850575] [2025-03-16 23:56:08,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:56:08,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 23:56:08,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 23:56:08,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:08,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 23:56:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:56:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019850575] [2025-03-16 23:56:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019850575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:09,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:09,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:56:09,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533825475] [2025-03-16 23:56:09,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:09,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:56:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:56:09,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:56:09,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:56:09,487 INFO L87 Difference]: Start difference. First operand 160 states and 228 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-16 23:56:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:09,807 INFO L93 Difference]: Finished difference Result 254 states and 363 transitions. [2025-03-16 23:56:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 23:56:09,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 135 [2025-03-16 23:56:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:09,809 INFO L225 Difference]: With dead ends: 254 [2025-03-16 23:56:09,809 INFO L226 Difference]: Without dead ends: 158 [2025-03-16 23:56:09,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:56:09,810 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 113 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:09,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 435 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:56:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-16 23:56:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2025-03-16 23:56:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 96 states have (on average 1.21875) internal successors, (117), 97 states have internal predecessors, (117), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 23:56:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2025-03-16 23:56:09,822 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 135 [2025-03-16 23:56:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:09,825 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2025-03-16 23:56:09,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-16 23:56:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2025-03-16 23:56:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 23:56:09,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:09,827 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 23:56:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:56:09,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1617603704, now seen corresponding path program 1 times [2025-03-16 23:56:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:56:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615522991] [2025-03-16 23:56:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:56:09,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:56:09,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:56:09,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:09,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-16 23:56:14,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:56:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615522991] [2025-03-16 23:56:14,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615522991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:56:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674606242] [2025-03-16 23:56:14,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:14,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:56:14,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:56:14,623 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-16 23:56:14,624 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-16 23:56:14,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:56:14,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:56:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:14,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 23:56:14,775 INFO L279 TraceCheckSpWp]: Computing forward predicates...