./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23501b270359c8bb66bf017123a6b997c736c6bad56bfcdab3d899e8f1555d26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:37:06,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:37:06,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:37:06,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:37:06,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:37:06,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:37:06,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:37:06,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:37:06,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:37:06,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:37:06,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:37:06,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:37:06,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:37:06,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:37:06,294 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:37:06,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:37:06,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:37:06,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:37:06,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:37:06,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:37:06,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:37:06,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:37:06,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:37:06,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:37:06,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:37:06,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:37:06,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23501b270359c8bb66bf017123a6b997c736c6bad56bfcdab3d899e8f1555d26 [2025-02-06 02:37:06,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:37:06,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:37:06,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:37:06,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:37:06,554 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:37:06,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i [2025-02-06 02:37:07,691 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aab94e80/fe71b406a79a4ee09de5d665027ebc7c/FLAG73b9d254c [2025-02-06 02:37:08,026 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:37:08,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i [2025-02-06 02:37:08,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aab94e80/fe71b406a79a4ee09de5d665027ebc7c/FLAG73b9d254c [2025-02-06 02:37:08,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aab94e80/fe71b406a79a4ee09de5d665027ebc7c [2025-02-06 02:37:08,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:37:08,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:37:08,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:37:08,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:37:08,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:37:08,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08, skipping insertion in model container [2025-02-06 02:37:08,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:37:08,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i[916,929] [2025-02-06 02:37:08,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:37:08,620 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:37:08,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-11.i[916,929] [2025-02-06 02:37:08,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:37:08,725 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:37:08,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08 WrapperNode [2025-02-06 02:37:08,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:37:08,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:37:08,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:37:08,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:37:08,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,828 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 802 [2025-02-06 02:37:08,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:37:08,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:37:08,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:37:08,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:37:08,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,945 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:37:08,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:08,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:09,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:37:09,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:37:09,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:37:09,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:37:09,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (1/1) ... [2025-02-06 02:37:09,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:37:09,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:37:09,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:37:09,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:37:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:37:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:37:09,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:37:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:37:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:37:09,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:37:09,214 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:37:09,216 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:37:10,122 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L660: havoc property_#t~bitwise54#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~short67#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short70#1;havoc property_#t~ite72#1;havoc property_#t~bitwise71#1;havoc property_#t~short73#1; [2025-02-06 02:37:10,272 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-02-06 02:37:10,272 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:37:10,303 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:37:10,303 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:37:10,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:10 BoogieIcfgContainer [2025-02-06 02:37:10,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:37:10,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:37:10,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:37:10,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:37:10,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:37:08" (1/3) ... [2025-02-06 02:37:10,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55af9bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:10, skipping insertion in model container [2025-02-06 02:37:10,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:08" (2/3) ... [2025-02-06 02:37:10,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55af9bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:10, skipping insertion in model container [2025-02-06 02:37:10,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:10" (3/3) ... [2025-02-06 02:37:10,312 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-11.i [2025-02-06 02:37:10,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:37:10,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-11.i that has 2 procedures, 316 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:37:10,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:37:10,380 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;@3d0f9f7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:37:10,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:37:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 316 states, 244 states have (on average 1.540983606557377) internal successors, (376), 245 states have internal predecessors, (376), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:37:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-02-06 02:37:10,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:10,400 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:10,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2092332007, now seen corresponding path program 1 times [2025-02-06 02:37:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466552006] [2025-02-06 02:37:10,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:10,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-02-06 02:37:10,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-02-06 02:37:10,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:10,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:11,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466552006] [2025-02-06 02:37:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466552006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262626896] [2025-02-06 02:37:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:11,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:11,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:11,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:11,313 INFO L87 Difference]: Start difference. First operand has 316 states, 244 states have (on average 1.540983606557377) internal successors, (376), 245 states have internal predecessors, (376), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:11,578 INFO L93 Difference]: Finished difference Result 921 states and 1646 transitions. [2025-02-06 02:37:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 491 [2025-02-06 02:37:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:11,595 INFO L225 Difference]: With dead ends: 921 [2025-02-06 02:37:11,595 INFO L226 Difference]: Without dead ends: 608 [2025-02-06 02:37:11,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:11,600 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 447 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:11,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 940 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:37:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-06 02:37:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 606. [2025-02-06 02:37:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 465 states have (on average 1.5161290322580645) internal successors, (705), 465 states have internal predecessors, (705), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 02:37:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 981 transitions. [2025-02-06 02:37:11,700 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 981 transitions. Word has length 491 [2025-02-06 02:37:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:11,704 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 981 transitions. [2025-02-06 02:37:11,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 981 transitions. [2025-02-06 02:37:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-02-06 02:37:11,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:11,717 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 02:37:11,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1440426425, now seen corresponding path program 1 times [2025-02-06 02:37:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:11,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914131311] [2025-02-06 02:37:11,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:11,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-02-06 02:37:11,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-02-06 02:37:11,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914131311] [2025-02-06 02:37:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914131311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117159182] [2025-02-06 02:37:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:12,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:12,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:12,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:12,178 INFO L87 Difference]: Start difference. First operand 606 states and 981 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:12,414 INFO L93 Difference]: Finished difference Result 1212 states and 1962 transitions. [2025-02-06 02:37:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:12,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 491 [2025-02-06 02:37:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:12,420 INFO L225 Difference]: With dead ends: 1212 [2025-02-06 02:37:12,420 INFO L226 Difference]: Without dead ends: 609 [2025-02-06 02:37:12,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:12,425 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 421 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:12,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1270 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:37:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-06 02:37:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2025-02-06 02:37:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 466 states have (on average 1.502145922746781) internal successors, (700), 466 states have internal predecessors, (700), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 02:37:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 976 transitions. [2025-02-06 02:37:12,477 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 976 transitions. Word has length 491 [2025-02-06 02:37:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:12,478 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 976 transitions. [2025-02-06 02:37:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 976 transitions. [2025-02-06 02:37:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-02-06 02:37:12,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:12,485 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:37:12,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:12,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1535844924, now seen corresponding path program 1 times [2025-02-06 02:37:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846753296] [2025-02-06 02:37:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:12,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:12,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-02-06 02:37:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-02-06 02:37:12,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:12,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:12,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846753296] [2025-02-06 02:37:12,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846753296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:12,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:12,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824057212] [2025-02-06 02:37:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:12,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:12,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:12,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:12,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:12,841 INFO L87 Difference]: Start difference. First operand 607 states and 976 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:12,968 INFO L93 Difference]: Finished difference Result 1811 states and 2914 transitions. [2025-02-06 02:37:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 492 [2025-02-06 02:37:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:12,975 INFO L225 Difference]: With dead ends: 1811 [2025-02-06 02:37:12,975 INFO L226 Difference]: Without dead ends: 1207 [2025-02-06 02:37:12,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:12,976 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 435 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:12,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-02-06 02:37:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 794. [2025-02-06 02:37:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 653 states have (on average 1.5436447166921898) internal successors, (1008), 653 states have internal predecessors, (1008), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 02:37:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1284 transitions. [2025-02-06 02:37:13,058 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1284 transitions. Word has length 492 [2025-02-06 02:37:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:13,061 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1284 transitions. [2025-02-06 02:37:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1284 transitions. [2025-02-06 02:37:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-02-06 02:37:13,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:13,070 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:13,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:37:13,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:13,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash 575445445, now seen corresponding path program 1 times [2025-02-06 02:37:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405340084] [2025-02-06 02:37:13,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:13,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-02-06 02:37:13,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-02-06 02:37:13,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:13,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:13,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405340084] [2025-02-06 02:37:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405340084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376546359] [2025-02-06 02:37:13,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:13,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:13,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:13,444 INFO L87 Difference]: Start difference. First operand 794 states and 1284 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:13,610 INFO L93 Difference]: Finished difference Result 1914 states and 3092 transitions. [2025-02-06 02:37:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 492 [2025-02-06 02:37:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:13,618 INFO L225 Difference]: With dead ends: 1914 [2025-02-06 02:37:13,618 INFO L226 Difference]: Without dead ends: 1123 [2025-02-06 02:37:13,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:13,621 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 186 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:13,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1398 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-02-06 02:37:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1020. [2025-02-06 02:37:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 879 states have (on average 1.5813424345847553) internal successors, (1390), 879 states have internal predecessors, (1390), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 02:37:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1666 transitions. [2025-02-06 02:37:13,680 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1666 transitions. Word has length 492 [2025-02-06 02:37:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1666 transitions. [2025-02-06 02:37:13,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1666 transitions. [2025-02-06 02:37:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-02-06 02:37:13,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:13,687 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:13,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:37:13,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:13,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2070626541, now seen corresponding path program 1 times [2025-02-06 02:37:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:13,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447734737] [2025-02-06 02:37:13,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:13,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-02-06 02:37:13,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-02-06 02:37:13,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:13,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447734737] [2025-02-06 02:37:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447734737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145608972] [2025-02-06 02:37:14,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:14,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:14,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:14,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:14,617 INFO L87 Difference]: Start difference. First operand 1020 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:14,899 INFO L93 Difference]: Finished difference Result 3015 states and 4925 transitions. [2025-02-06 02:37:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 493 [2025-02-06 02:37:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:14,906 INFO L225 Difference]: With dead ends: 3015 [2025-02-06 02:37:14,907 INFO L226 Difference]: Without dead ends: 1998 [2025-02-06 02:37:14,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-06 02:37:14,909 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 678 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:14,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1261 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:37:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2025-02-06 02:37:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1328. [2025-02-06 02:37:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1187 states have (on average 1.6074136478517271) internal successors, (1908), 1187 states have internal predecessors, (1908), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 02:37:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2184 transitions. [2025-02-06 02:37:14,955 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2184 transitions. Word has length 493 [2025-02-06 02:37:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:14,956 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2184 transitions. [2025-02-06 02:37:14,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2184 transitions. [2025-02-06 02:37:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-02-06 02:37:14,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:14,960 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:37:14,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:14,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash -937435948, now seen corresponding path program 1 times [2025-02-06 02:37:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:14,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388017217] [2025-02-06 02:37:14,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:15,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-02-06 02:37:15,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-02-06 02:37:15,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:15,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388017217] [2025-02-06 02:37:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388017217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852306609] [2025-02-06 02:37:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:16,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:16,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:16,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:16,005 INFO L87 Difference]: Start difference. First operand 1328 states and 2184 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:16,662 INFO L93 Difference]: Finished difference Result 3841 states and 6324 transitions. [2025-02-06 02:37:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 493 [2025-02-06 02:37:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:16,676 INFO L225 Difference]: With dead ends: 3841 [2025-02-06 02:37:16,676 INFO L226 Difference]: Without dead ends: 2516 [2025-02-06 02:37:16,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:16,680 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 409 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:16,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1400 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:37:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-02-06 02:37:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2477. [2025-02-06 02:37:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2266 states have (on average 1.620476610767873) internal successors, (3672), 2266 states have internal predecessors, (3672), 207 states have call successors, (207), 3 states have call predecessors, (207), 3 states have return successors, (207), 207 states have call predecessors, (207), 207 states have call successors, (207) [2025-02-06 02:37:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 4086 transitions. [2025-02-06 02:37:16,784 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 4086 transitions. Word has length 493 [2025-02-06 02:37:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:16,786 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 4086 transitions. [2025-02-06 02:37:16,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 4086 transitions. [2025-02-06 02:37:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-02-06 02:37:16,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:16,792 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:37:16,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1233957289, now seen corresponding path program 1 times [2025-02-06 02:37:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150915896] [2025-02-06 02:37:16,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-02-06 02:37:17,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-02-06 02:37:17,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:17,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150915896] [2025-02-06 02:37:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150915896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:37:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028007715] [2025-02-06 02:37:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:37:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:19,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:37:19,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:37:19,096 INFO L87 Difference]: Start difference. First operand 2477 states and 4086 transitions. Second operand has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-06 02:37:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:22,127 INFO L93 Difference]: Finished difference Result 9737 states and 16059 transitions. [2025-02-06 02:37:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:37:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 494 [2025-02-06 02:37:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:22,155 INFO L225 Difference]: With dead ends: 9737 [2025-02-06 02:37:22,155 INFO L226 Difference]: Without dead ends: 8050 [2025-02-06 02:37:22,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:37:22,160 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 2775 mSDsluCounter, 4430 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 5384 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:22,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 5384 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 02:37:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8050 states. [2025-02-06 02:37:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8050 to 5114. [2025-02-06 02:37:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 4788 states have (on average 1.6330409356725146) internal successors, (7819), 4790 states have internal predecessors, (7819), 319 states have call successors, (319), 6 states have call predecessors, (319), 6 states have return successors, (319), 317 states have call predecessors, (319), 319 states have call successors, (319) [2025-02-06 02:37:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 8457 transitions. [2025-02-06 02:37:22,404 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 8457 transitions. Word has length 494 [2025-02-06 02:37:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:22,405 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 8457 transitions. [2025-02-06 02:37:22,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-06 02:37:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 8457 transitions. [2025-02-06 02:37:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-02-06 02:37:22,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:22,412 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:22,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:37:22,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:22,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1025258986, now seen corresponding path program 1 times [2025-02-06 02:37:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604374906] [2025-02-06 02:37:22,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-02-06 02:37:22,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-02-06 02:37:22,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:22,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:23,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604374906] [2025-02-06 02:37:23,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604374906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50227131] [2025-02-06 02:37:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:23,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:23,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:23,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:23,288 INFO L87 Difference]: Start difference. First operand 5114 states and 8457 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:23,752 INFO L93 Difference]: Finished difference Result 9912 states and 16385 transitions. [2025-02-06 02:37:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 494 [2025-02-06 02:37:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:23,774 INFO L225 Difference]: With dead ends: 9912 [2025-02-06 02:37:23,774 INFO L226 Difference]: Without dead ends: 5190 [2025-02-06 02:37:23,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:23,782 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 422 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:23,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1422 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:37:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2025-02-06 02:37:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5114. [2025-02-06 02:37:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 4788 states have (on average 1.6284461152882206) internal successors, (7797), 4790 states have internal predecessors, (7797), 319 states have call successors, (319), 6 states have call predecessors, (319), 6 states have return successors, (319), 317 states have call predecessors, (319), 319 states have call successors, (319) [2025-02-06 02:37:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 8435 transitions. [2025-02-06 02:37:23,988 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 8435 transitions. Word has length 494 [2025-02-06 02:37:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 8435 transitions. [2025-02-06 02:37:23,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 8435 transitions. [2025-02-06 02:37:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-02-06 02:37:23,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:23,997 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:37:23,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1865806268, now seen corresponding path program 1 times [2025-02-06 02:37:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119326036] [2025-02-06 02:37:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:24,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-02-06 02:37:24,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-02-06 02:37:24,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:24,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:24,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:24,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119326036] [2025-02-06 02:37:24,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119326036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:24,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:24,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:24,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450833433] [2025-02-06 02:37:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:24,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:24,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:24,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:24,322 INFO L87 Difference]: Start difference. First operand 5114 states and 8435 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:24,770 INFO L93 Difference]: Finished difference Result 12776 states and 21022 transitions. [2025-02-06 02:37:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 495 [2025-02-06 02:37:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:24,819 INFO L225 Difference]: With dead ends: 12776 [2025-02-06 02:37:24,819 INFO L226 Difference]: Without dead ends: 8054 [2025-02-06 02:37:24,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:24,844 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 667 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:24,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1532 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:37:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2025-02-06 02:37:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 7874. [2025-02-06 02:37:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7874 states, 7294 states have (on average 1.6132437619961613) internal successors, (11767), 7298 states have internal predecessors, (11767), 569 states have call successors, (569), 10 states have call predecessors, (569), 10 states have return successors, (569), 565 states have call predecessors, (569), 569 states have call successors, (569) [2025-02-06 02:37:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7874 states to 7874 states and 12905 transitions. [2025-02-06 02:37:25,171 INFO L78 Accepts]: Start accepts. Automaton has 7874 states and 12905 transitions. Word has length 495 [2025-02-06 02:37:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 7874 states and 12905 transitions. [2025-02-06 02:37:25,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7874 states and 12905 transitions. [2025-02-06 02:37:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-02-06 02:37:25,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:25,179 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:25,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:37:25,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:25,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1080882138, now seen corresponding path program 1 times [2025-02-06 02:37:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705257902] [2025-02-06 02:37:25,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:25,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-02-06 02:37:25,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-02-06 02:37:25,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:25,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:25,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:25,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705257902] [2025-02-06 02:37:25,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705257902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:25,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:25,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:25,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781235351] [2025-02-06 02:37:25,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:25,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:25,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:25,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:25,887 INFO L87 Difference]: Start difference. First operand 7874 states and 12905 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:26,304 INFO L93 Difference]: Finished difference Result 20990 states and 34343 transitions. [2025-02-06 02:37:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 496 [2025-02-06 02:37:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:26,340 INFO L225 Difference]: With dead ends: 20990 [2025-02-06 02:37:26,341 INFO L226 Difference]: Without dead ends: 13977 [2025-02-06 02:37:26,356 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-02-06 02:37:26,357 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 300 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:26,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1746 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:37:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13977 states. [2025-02-06 02:37:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13977 to 13188. [2025-02-06 02:37:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13188 states, 12416 states have (on average 1.600757087628866) internal successors, (19875), 12428 states have internal predecessors, (19875), 753 states have call successors, (753), 18 states have call predecessors, (753), 18 states have return successors, (753), 741 states have call predecessors, (753), 753 states have call successors, (753) [2025-02-06 02:37:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13188 states to 13188 states and 21381 transitions. [2025-02-06 02:37:26,956 INFO L78 Accepts]: Start accepts. Automaton has 13188 states and 21381 transitions. Word has length 496 [2025-02-06 02:37:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:26,956 INFO L471 AbstractCegarLoop]: Abstraction has 13188 states and 21381 transitions. [2025-02-06 02:37:26,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 13188 states and 21381 transitions. [2025-02-06 02:37:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-02-06 02:37:26,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:26,971 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:26,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:37:26,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:26,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2117030020, now seen corresponding path program 1 times [2025-02-06 02:37:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:26,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084353180] [2025-02-06 02:37:26,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:26,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:27,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-02-06 02:37:27,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-02-06 02:37:27,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:27,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084353180] [2025-02-06 02:37:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084353180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:37:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269761805] [2025-02-06 02:37:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:28,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:37:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:37:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:28,088 INFO L87 Difference]: Start difference. First operand 13188 states and 21381 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:29,110 INFO L93 Difference]: Finished difference Result 24440 states and 39431 transitions. [2025-02-06 02:37:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:37:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 497 [2025-02-06 02:37:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:29,145 INFO L225 Difference]: With dead ends: 24440 [2025-02-06 02:37:29,145 INFO L226 Difference]: Without dead ends: 15607 [2025-02-06 02:37:29,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:37:29,159 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 919 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:29,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2054 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:37:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15607 states. [2025-02-06 02:37:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15607 to 12801. [2025-02-06 02:37:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12801 states, 12029 states have (on average 1.5989691578684846) internal successors, (19234), 12041 states have internal predecessors, (19234), 753 states have call successors, (753), 18 states have call predecessors, (753), 18 states have return successors, (753), 741 states have call predecessors, (753), 753 states have call successors, (753) [2025-02-06 02:37:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12801 states to 12801 states and 20740 transitions. [2025-02-06 02:37:29,550 INFO L78 Accepts]: Start accepts. Automaton has 12801 states and 20740 transitions. Word has length 497 [2025-02-06 02:37:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 12801 states and 20740 transitions. [2025-02-06 02:37:29,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 12801 states and 20740 transitions. [2025-02-06 02:37:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-02-06 02:37:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:29,561 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:37:29,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:29,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2031074470, now seen corresponding path program 1 times [2025-02-06 02:37:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350310166] [2025-02-06 02:37:29,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:29,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-02-06 02:37:29,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-02-06 02:37:29,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:29,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350310166] [2025-02-06 02:37:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350310166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:37:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646354734] [2025-02-06 02:37:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:30,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:37:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:30,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:37:30,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:30,349 INFO L87 Difference]: Start difference. First operand 12801 states and 20740 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:31,101 INFO L93 Difference]: Finished difference Result 24574 states and 39793 transitions. [2025-02-06 02:37:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:37:31,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 498 [2025-02-06 02:37:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:31,136 INFO L225 Difference]: With dead ends: 24574 [2025-02-06 02:37:31,136 INFO L226 Difference]: Without dead ends: 12316 [2025-02-06 02:37:31,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:37:31,154 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 776 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:31,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1742 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:37:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2025-02-06 02:37:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 10607. [2025-02-06 02:37:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10607 states, 9835 states have (on average 1.595729537366548) internal successors, (15694), 9847 states have internal predecessors, (15694), 753 states have call successors, (753), 18 states have call predecessors, (753), 18 states have return successors, (753), 741 states have call predecessors, (753), 753 states have call successors, (753) [2025-02-06 02:37:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 17200 transitions. [2025-02-06 02:37:31,880 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 17200 transitions. Word has length 498 [2025-02-06 02:37:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 10607 states and 17200 transitions. [2025-02-06 02:37:31,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 17200 transitions. [2025-02-06 02:37:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-06 02:37:31,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:31,889 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:31,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:37:31,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:31,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 581237652, now seen corresponding path program 1 times [2025-02-06 02:37:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:31,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137856385] [2025-02-06 02:37:31,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:31,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-06 02:37:32,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-06 02:37:32,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:32,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137856385] [2025-02-06 02:37:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137856385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:32,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:32,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317449079] [2025-02-06 02:37:32,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:32,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:32,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:32,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:32,763 INFO L87 Difference]: Start difference. First operand 10607 states and 17200 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:33,682 INFO L93 Difference]: Finished difference Result 21396 states and 34629 transitions. [2025-02-06 02:37:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:33,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 499 [2025-02-06 02:37:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:33,749 INFO L225 Difference]: With dead ends: 21396 [2025-02-06 02:37:33,749 INFO L226 Difference]: Without dead ends: 10916 [2025-02-06 02:37:33,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:33,759 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 420 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:33,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1416 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:37:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10916 states. [2025-02-06 02:37:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10916 to 10606. [2025-02-06 02:37:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10606 states, 9834 states have (on average 1.5955867398820418) internal successors, (15691), 9846 states have internal predecessors, (15691), 753 states have call successors, (753), 18 states have call predecessors, (753), 18 states have return successors, (753), 741 states have call predecessors, (753), 753 states have call successors, (753) [2025-02-06 02:37:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 17197 transitions. [2025-02-06 02:37:34,141 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 17197 transitions. Word has length 499 [2025-02-06 02:37:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:34,141 INFO L471 AbstractCegarLoop]: Abstraction has 10606 states and 17197 transitions. [2025-02-06 02:37:34,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 17197 transitions. [2025-02-06 02:37:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-06 02:37:34,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:34,148 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:34,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:37:34,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:34,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1459405766, now seen corresponding path program 1 times [2025-02-06 02:37:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358005952] [2025-02-06 02:37:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:34,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-06 02:37:34,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-06 02:37:34,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358005952] [2025-02-06 02:37:34,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358005952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:34,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:34,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:34,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439523770] [2025-02-06 02:37:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:34,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:34,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:34,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:34,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:34,719 INFO L87 Difference]: Start difference. First operand 10606 states and 17197 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:35,684 INFO L93 Difference]: Finished difference Result 35554 states and 57533 transitions. [2025-02-06 02:37:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:35,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 499 [2025-02-06 02:37:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:35,730 INFO L225 Difference]: With dead ends: 35554 [2025-02-06 02:37:35,730 INFO L226 Difference]: Without dead ends: 26614 [2025-02-06 02:37:35,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:35,741 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 860 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:35,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1673 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:37:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26614 states. [2025-02-06 02:37:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26614 to 25422. [2025-02-06 02:37:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25422 states, 23950 states have (on average 1.6040918580375783) internal successors, (38418), 23974 states have internal predecessors, (38418), 1437 states have call successors, (1437), 34 states have call predecessors, (1437), 34 states have return successors, (1437), 1413 states have call predecessors, (1437), 1437 states have call successors, (1437) [2025-02-06 02:37:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25422 states to 25422 states and 41292 transitions. [2025-02-06 02:37:37,016 INFO L78 Accepts]: Start accepts. Automaton has 25422 states and 41292 transitions. Word has length 499 [2025-02-06 02:37:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:37,020 INFO L471 AbstractCegarLoop]: Abstraction has 25422 states and 41292 transitions. [2025-02-06 02:37:37,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 25422 states and 41292 transitions. [2025-02-06 02:37:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-06 02:37:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:37,042 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:37:37,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash -855306014, now seen corresponding path program 1 times [2025-02-06 02:37:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626369644] [2025-02-06 02:37:37,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:37,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-06 02:37:37,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-06 02:37:37,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:37,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626369644] [2025-02-06 02:37:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626369644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:39,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:37:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371240428] [2025-02-06 02:37:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:37:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:39,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:37:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:37:39,203 INFO L87 Difference]: Start difference. First operand 25422 states and 41292 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:40,626 INFO L93 Difference]: Finished difference Result 47769 states and 77224 transitions. [2025-02-06 02:37:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:37:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 500 [2025-02-06 02:37:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:40,674 INFO L225 Difference]: With dead ends: 47769 [2025-02-06 02:37:40,674 INFO L226 Difference]: Without dead ends: 28061 [2025-02-06 02:37:40,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:37:40,702 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1417 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:40,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 2100 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:37:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28061 states. [2025-02-06 02:37:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28061 to 26721. [2025-02-06 02:37:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26721 states, 25249 states have (on average 1.6056477484256801) internal successors, (40541), 25273 states have internal predecessors, (40541), 1437 states have call successors, (1437), 34 states have call predecessors, (1437), 34 states have return successors, (1437), 1413 states have call predecessors, (1437), 1437 states have call successors, (1437) [2025-02-06 02:37:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26721 states to 26721 states and 43415 transitions. [2025-02-06 02:37:41,696 INFO L78 Accepts]: Start accepts. Automaton has 26721 states and 43415 transitions. Word has length 500 [2025-02-06 02:37:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:41,698 INFO L471 AbstractCegarLoop]: Abstraction has 26721 states and 43415 transitions. [2025-02-06 02:37:41,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 26721 states and 43415 transitions. [2025-02-06 02:37:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-06 02:37:41,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:41,714 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:41,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:37:41,714 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:41,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash -895436530, now seen corresponding path program 1 times [2025-02-06 02:37:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821763270] [2025-02-06 02:37:41,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:41,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-06 02:37:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-06 02:37:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:37:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821763270] [2025-02-06 02:37:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821763270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:37:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192000249] [2025-02-06 02:37:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:43,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:37:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:43,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:37:43,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:37:43,300 INFO L87 Difference]: Start difference. First operand 26721 states and 43415 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:45,349 INFO L93 Difference]: Finished difference Result 70997 states and 115537 transitions. [2025-02-06 02:37:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:37:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 500 [2025-02-06 02:37:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:45,438 INFO L225 Difference]: With dead ends: 70997 [2025-02-06 02:37:45,439 INFO L226 Difference]: Without dead ends: 50923 [2025-02-06 02:37:45,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:37:45,471 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 2073 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:45,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 3468 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:37:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50923 states. [2025-02-06 02:37:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50923 to 32933. [2025-02-06 02:37:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32933 states, 31461 states have (on average 1.613839356663806) internal successors, (50773), 31485 states have internal predecessors, (50773), 1437 states have call successors, (1437), 34 states have call predecessors, (1437), 34 states have return successors, (1437), 1413 states have call predecessors, (1437), 1437 states have call successors, (1437) [2025-02-06 02:37:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32933 states to 32933 states and 53647 transitions. [2025-02-06 02:37:46,853 INFO L78 Accepts]: Start accepts. Automaton has 32933 states and 53647 transitions. Word has length 500 [2025-02-06 02:37:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 32933 states and 53647 transitions. [2025-02-06 02:37:46,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:37:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 32933 states and 53647 transitions. [2025-02-06 02:37:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-06 02:37:46,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:46,872 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:37:46,873 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -881903729, now seen corresponding path program 1 times [2025-02-06 02:37:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374490343] [2025-02-06 02:37:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:46,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-06 02:37:47,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-06 02:37:47,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:23,720 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 116 DAG size of output: 114 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)