./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-43.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 ecbcd709fd39c3e33cec5f2b119267d660716122d9f0521d15b09d678f2b82b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:05:01,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:05:02,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:05:02,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:05:02,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:05:02,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:05:02,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:05:02,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:05:02,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:05:02,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:05:02,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:05:02,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:05:02,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:05:02,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:05:02,073 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:05:02,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:05:02,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:05:02,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:05:02,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:05:02,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:05:02,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:05:02,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:05:02,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:02,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:05:02,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:02,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:05:02,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:05:02,078 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 -> ecbcd709fd39c3e33cec5f2b119267d660716122d9f0521d15b09d678f2b82b7 [2025-01-09 10:05:02,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:05:02,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:05:02,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:05:02,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:05:02,392 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:05:02,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-43.i [2025-01-09 10:05:03,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be54fa771/74c0d1852ca043e7891a7f3dc9ed7fde/FLAG40f800899 [2025-01-09 10:05:04,092 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:05:04,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-43.i [2025-01-09 10:05:04,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be54fa771/74c0d1852ca043e7891a7f3dc9ed7fde/FLAG40f800899 [2025-01-09 10:05:04,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be54fa771/74c0d1852ca043e7891a7f3dc9ed7fde [2025-01-09 10:05:04,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:05:04,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:05:04,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:05:04,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:05:04,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:05:04,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0553fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04, skipping insertion in model container [2025-01-09 10:05:04,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:05:04,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-43.i[916,929] [2025-01-09 10:05:04,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:05:04,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:05:04,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-43.i[916,929] [2025-01-09 10:05:04,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:05:04,630 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:05:04,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04 WrapperNode [2025-01-09 10:05:04,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:05:04,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:05:04,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:05:04,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:05:04,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,755 INFO L138 Inliner]: procedures = 26, calls = 115, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 863 [2025-01-09 10:05:04,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:05:04,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:05:04,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:05:04,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:05:04,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,810 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-01-09 10:05:04,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:05:04,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:05:04,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:05:04,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:05:04,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:04,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:04,927 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-01-09 10:05:04,932 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-01-09 10:05:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:05:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:05:04,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:05:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:05:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:05:04,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:05:05,122 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:05:05,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:05:06,470 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 10:05:06,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:05:06,495 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:05:06,495 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:05:06,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:05:06 BoogieIcfgContainer [2025-01-09 10:05:06,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:05:06,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:05:06,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:05:06,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:05:06,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:05:04" (1/3) ... [2025-01-09 10:05:06,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a00001e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:05:06, skipping insertion in model container [2025-01-09 10:05:06,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04" (2/3) ... [2025-01-09 10:05:06,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a00001e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:05:06, skipping insertion in model container [2025-01-09 10:05:06,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:05:06" (3/3) ... [2025-01-09 10:05:06,507 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-43.i [2025-01-09 10:05:06,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:05:06,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-43.i that has 2 procedures, 354 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:05:06,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:05:06,618 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;@386bf8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:05:06,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:05:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 354 states, 249 states have (on average 1.5983935742971886) internal successors, (398), 250 states have internal predecessors, (398), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:05:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:06,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:06,663 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:06,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:06,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 858298742, now seen corresponding path program 1 times [2025-01-09 10:05:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122317955] [2025-01-09 10:05:06,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:06,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:06,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:06,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:06,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-01-09 10:05:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122317955] [2025-01-09 10:05:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122317955] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699204418] [2025-01-09 10:05:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:07,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:05:07,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:05:07,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:07,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:07,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:07,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:07,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:05:07,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-01-09 10:05:08,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:05:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699204418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:08,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:05:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:05:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545394367] [2025-01-09 10:05:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:08,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:05:08,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:08,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:05:08,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:05:08,062 INFO L87 Difference]: Start difference. First operand has 354 states, 249 states have (on average 1.5983935742971886) internal successors, (398), 250 states have internal predecessors, (398), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-01-09 10:05:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:08,141 INFO L93 Difference]: Finished difference Result 702 states and 1301 transitions. [2025-01-09 10:05:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:05:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) Word has length 662 [2025-01-09 10:05:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:08,152 INFO L225 Difference]: With dead ends: 702 [2025-01-09 10:05:08,152 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 10:05:08,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:05:08,164 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:08,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 10:05:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-01-09 10:05:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 247 states have (on average 1.591093117408907) internal successors, (393), 247 states have internal predecessors, (393), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:05:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 597 transitions. [2025-01-09 10:05:08,271 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 597 transitions. Word has length 662 [2025-01-09 10:05:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:08,272 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 597 transitions. [2025-01-09 10:05:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-01-09 10:05:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 597 transitions. [2025-01-09 10:05:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:08,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:08,294 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:08,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:05:08,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:05:08,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1925887294, now seen corresponding path program 1 times [2025-01-09 10:05:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002838445] [2025-01-09 10:05:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:08,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:08,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:08,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:08,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002838445] [2025-01-09 10:05:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002838445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:09,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:09,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365618085] [2025-01-09 10:05:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:09,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:09,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:09,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:09,401 INFO L87 Difference]: Start difference. First operand 351 states and 597 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:09,522 INFO L93 Difference]: Finished difference Result 950 states and 1622 transitions. [2025-01-09 10:05:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:09,530 INFO L225 Difference]: With dead ends: 950 [2025-01-09 10:05:09,530 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 10:05:09,532 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-01-09 10:05:09,532 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 426 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:09,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1297 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 10:05:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 599. [2025-01-09 10:05:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 445 states have (on average 1.6134831460674157) internal successors, (718), 446 states have internal predecessors, (718), 151 states have call successors, (151), 2 states have call predecessors, (151), 2 states have return successors, (151), 150 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 10:05:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1020 transitions. [2025-01-09 10:05:09,612 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1020 transitions. Word has length 662 [2025-01-09 10:05:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:09,616 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 1020 transitions. [2025-01-09 10:05:09,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1020 transitions. [2025-01-09 10:05:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:09,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:09,637 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:09,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:05:09,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:09,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash -489949056, now seen corresponding path program 1 times [2025-01-09 10:05:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082832863] [2025-01-09 10:05:09,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:09,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:09,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:09,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082832863] [2025-01-09 10:05:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082832863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:10,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984997618] [2025-01-09 10:05:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:10,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:10,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:10,131 INFO L87 Difference]: Start difference. First operand 599 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:10,254 INFO L93 Difference]: Finished difference Result 1684 states and 2875 transitions. [2025-01-09 10:05:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:10,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:10,268 INFO L225 Difference]: With dead ends: 1684 [2025-01-09 10:05:10,268 INFO L226 Difference]: Without dead ends: 1088 [2025-01-09 10:05:10,271 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-01-09 10:05:10,272 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 412 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:10,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1318 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-01-09 10:05:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1085. [2025-01-09 10:05:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 829 states have (on average 1.6260554885404102) internal successors, (1348), 832 states have internal predecessors, (1348), 251 states have call successors, (251), 4 states have call predecessors, (251), 4 states have return successors, (251), 248 states have call predecessors, (251), 251 states have call successors, (251) [2025-01-09 10:05:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1850 transitions. [2025-01-09 10:05:10,372 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1850 transitions. Word has length 662 [2025-01-09 10:05:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:10,376 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1850 transitions. [2025-01-09 10:05:10,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1850 transitions. [2025-01-09 10:05:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:10,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:10,385 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:05:10,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 899920772, now seen corresponding path program 1 times [2025-01-09 10:05:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687606708] [2025-01-09 10:05:10,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:10,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687606708] [2025-01-09 10:05:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687606708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409042078] [2025-01-09 10:05:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:10,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:10,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:10,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:10,810 INFO L87 Difference]: Start difference. First operand 1085 states and 1850 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:10,963 INFO L93 Difference]: Finished difference Result 3044 states and 5182 transitions. [2025-01-09 10:05:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:10,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:10,980 INFO L225 Difference]: With dead ends: 3044 [2025-01-09 10:05:10,981 INFO L226 Difference]: Without dead ends: 1962 [2025-01-09 10:05:10,984 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-01-09 10:05:10,985 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 382 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:10,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-09 10:05:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1959. [2025-01-09 10:05:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1478 states have (on average 1.6055480378890392) internal successors, (2373), 1485 states have internal predecessors, (2373), 472 states have call successors, (472), 8 states have call predecessors, (472), 8 states have return successors, (472), 465 states have call predecessors, (472), 472 states have call successors, (472) [2025-01-09 10:05:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3317 transitions. [2025-01-09 10:05:11,160 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3317 transitions. Word has length 662 [2025-01-09 10:05:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:11,162 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 3317 transitions. [2025-01-09 10:05:11,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3317 transitions. [2025-01-09 10:05:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:11,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:11,172 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:11,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:05:11,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:11,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1529134088, now seen corresponding path program 1 times [2025-01-09 10:05:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704300882] [2025-01-09 10:05:11,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:11,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:11,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:11,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:11,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704300882] [2025-01-09 10:05:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704300882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:11,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945623289] [2025-01-09 10:05:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:11,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:11,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:11,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:11,501 INFO L87 Difference]: Start difference. First operand 1959 states and 3317 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:11,731 INFO L93 Difference]: Finished difference Result 5661 states and 9570 transitions. [2025-01-09 10:05:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:11,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:11,766 INFO L225 Difference]: With dead ends: 5661 [2025-01-09 10:05:11,766 INFO L226 Difference]: Without dead ends: 3705 [2025-01-09 10:05:11,775 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-01-09 10:05:11,777 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 380 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:11,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1163 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2025-01-09 10:05:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3701. [2025-01-09 10:05:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 2792 states have (on average 1.5898997134670487) internal successors, (4439), 2807 states have internal predecessors, (4439), 892 states have call successors, (892), 16 states have call predecessors, (892), 16 states have return successors, (892), 877 states have call predecessors, (892), 892 states have call successors, (892) [2025-01-09 10:05:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 6223 transitions. [2025-01-09 10:05:12,136 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 6223 transitions. Word has length 662 [2025-01-09 10:05:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:12,138 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 6223 transitions. [2025-01-09 10:05:12,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 6223 transitions. [2025-01-09 10:05:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:12,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:12,151 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:12,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:05:12,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash -394093946, now seen corresponding path program 1 times [2025-01-09 10:05:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186357398] [2025-01-09 10:05:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:12,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:12,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:12,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186357398] [2025-01-09 10:05:12,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186357398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:12,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:12,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780260024] [2025-01-09 10:05:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:12,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:12,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:12,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:12,571 INFO L87 Difference]: Start difference. First operand 3701 states and 6223 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:12,751 INFO L93 Difference]: Finished difference Result 7415 states and 12475 transitions. [2025-01-09 10:05:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:12,783 INFO L225 Difference]: With dead ends: 7415 [2025-01-09 10:05:12,784 INFO L226 Difference]: Without dead ends: 3717 [2025-01-09 10:05:12,829 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-01-09 10:05:12,830 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2025-01-09 10:05:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3717. [2025-01-09 10:05:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 2808 states have (on average 1.5865384615384615) internal successors, (4455), 2823 states have internal predecessors, (4455), 892 states have call successors, (892), 16 states have call predecessors, (892), 16 states have return successors, (892), 877 states have call predecessors, (892), 892 states have call successors, (892) [2025-01-09 10:05:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 6239 transitions. [2025-01-09 10:05:13,078 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 6239 transitions. Word has length 662 [2025-01-09 10:05:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:13,080 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 6239 transitions. [2025-01-09 10:05:13,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 6239 transitions. [2025-01-09 10:05:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:13,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:13,090 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:13,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:05:13,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1380913416, now seen corresponding path program 1 times [2025-01-09 10:05:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427540721] [2025-01-09 10:05:13,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:13,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:13,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:13,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:13,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:13,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427540721] [2025-01-09 10:05:13,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427540721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687399578] [2025-01-09 10:05:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:13,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:13,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:13,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:13,847 INFO L87 Difference]: Start difference. First operand 3717 states and 6239 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:14,449 INFO L93 Difference]: Finished difference Result 11145 states and 18711 transitions. [2025-01-09 10:05:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:14,515 INFO L225 Difference]: With dead ends: 11145 [2025-01-09 10:05:14,515 INFO L226 Difference]: Without dead ends: 7431 [2025-01-09 10:05:14,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:14,535 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 429 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:14,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1457 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2025-01-09 10:05:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2025-01-09 10:05:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 5612 states have (on average 1.5867783321454028) internal successors, (8905), 5642 states have internal predecessors, (8905), 1784 states have call successors, (1784), 32 states have call predecessors, (1784), 32 states have return successors, (1784), 1754 states have call predecessors, (1784), 1784 states have call successors, (1784) [2025-01-09 10:05:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 12473 transitions. [2025-01-09 10:05:15,168 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 12473 transitions. Word has length 662 [2025-01-09 10:05:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:15,169 INFO L471 AbstractCegarLoop]: Abstraction has 7429 states and 12473 transitions. [2025-01-09 10:05:15,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 12473 transitions. [2025-01-09 10:05:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-01-09 10:05:15,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:15,184 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:15,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:05:15,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:15,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2143320314, now seen corresponding path program 1 times [2025-01-09 10:05:15,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:15,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159113239] [2025-01-09 10:05:15,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:15,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-09 10:05:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-09 10:05:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159113239] [2025-01-09 10:05:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159113239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350303825] [2025-01-09 10:05:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:15,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:15,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:15,717 INFO L87 Difference]: Start difference. First operand 7429 states and 12473 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:16,198 INFO L93 Difference]: Finished difference Result 11143 states and 18709 transitions. [2025-01-09 10:05:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-01-09 10:05:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:16,280 INFO L225 Difference]: With dead ends: 11143 [2025-01-09 10:05:16,281 INFO L226 Difference]: Without dead ends: 7429 [2025-01-09 10:05:16,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:16,299 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:16,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 571 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2025-01-09 10:05:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 3717. [2025-01-09 10:05:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 2808 states have (on average 1.5861823361823362) internal successors, (4454), 2823 states have internal predecessors, (4454), 892 states have call successors, (892), 16 states have call predecessors, (892), 16 states have return successors, (892), 877 states have call predecessors, (892), 892 states have call successors, (892) [2025-01-09 10:05:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 6238 transitions. [2025-01-09 10:05:16,816 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 6238 transitions. Word has length 662 [2025-01-09 10:05:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:16,818 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 6238 transitions. [2025-01-09 10:05:16,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 6238 transitions. [2025-01-09 10:05:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 10:05:16,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:16,828 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:16,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:05:16,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -179002793, now seen corresponding path program 1 times [2025-01-09 10:05:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826968510] [2025-01-09 10:05:16,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:16,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 10:05:16,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 10:05:16,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:16,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:17,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:17,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826968510] [2025-01-09 10:05:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826968510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:17,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39694236] [2025-01-09 10:05:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:17,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:17,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:17,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:17,475 INFO L87 Difference]: Start difference. First operand 3717 states and 6238 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:18,510 INFO L93 Difference]: Finished difference Result 10494 states and 17642 transitions. [2025-01-09 10:05:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:05:18,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-01-09 10:05:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:18,551 INFO L225 Difference]: With dead ends: 10494 [2025-01-09 10:05:18,551 INFO L226 Difference]: Without dead ends: 6780 [2025-01-09 10:05:18,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:18,572 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 986 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:18,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1003 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:05:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6780 states. [2025-01-09 10:05:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6780 to 6762. [2025-01-09 10:05:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 5357 states have (on average 1.613403024080642) internal successors, (8643), 5388 states have internal predecessors, (8643), 1372 states have call successors, (1372), 32 states have call predecessors, (1372), 32 states have return successors, (1372), 1341 states have call predecessors, (1372), 1372 states have call successors, (1372) [2025-01-09 10:05:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 11387 transitions. [2025-01-09 10:05:19,094 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 11387 transitions. Word has length 663 [2025-01-09 10:05:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 11387 transitions. [2025-01-09 10:05:19,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 11387 transitions. [2025-01-09 10:05:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 10:05:19,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:19,110 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:19,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:05:19,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1579423214, now seen corresponding path program 1 times [2025-01-09 10:05:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876799514] [2025-01-09 10:05:19,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:19,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 10:05:19,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 10:05:19,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:19,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876799514] [2025-01-09 10:05:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876799514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840288510] [2025-01-09 10:05:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:19,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:19,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:19,687 INFO L87 Difference]: Start difference. First operand 6762 states and 11387 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:20,352 INFO L93 Difference]: Finished difference Result 20280 states and 34155 transitions. [2025-01-09 10:05:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 664 [2025-01-09 10:05:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:20,422 INFO L225 Difference]: With dead ends: 20280 [2025-01-09 10:05:20,422 INFO L226 Difference]: Without dead ends: 13521 [2025-01-09 10:05:20,456 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-01-09 10:05:20,457 INFO L435 NwaCegarLoop]: 1134 mSDtfsCounter, 591 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:20,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1726 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13521 states. [2025-01-09 10:05:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13521 to 13519. [2025-01-09 10:05:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13519 states, 10710 states have (on average 1.6106442577030813) internal successors, (17250), 10772 states have internal predecessors, (17250), 2744 states have call successors, (2744), 64 states have call predecessors, (2744), 64 states have return successors, (2744), 2682 states have call predecessors, (2744), 2744 states have call successors, (2744) [2025-01-09 10:05:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13519 states to 13519 states and 22738 transitions. [2025-01-09 10:05:21,527 INFO L78 Accepts]: Start accepts. Automaton has 13519 states and 22738 transitions. Word has length 664 [2025-01-09 10:05:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 13519 states and 22738 transitions. [2025-01-09 10:05:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 13519 states and 22738 transitions. [2025-01-09 10:05:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 10:05:21,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:21,548 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:21,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:05:21,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:21,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1798277932, now seen corresponding path program 1 times [2025-01-09 10:05:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:21,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035937961] [2025-01-09 10:05:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:21,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 10:05:22,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 10:05:22,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:22,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035937961] [2025-01-09 10:05:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035937961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:05:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761882644] [2025-01-09 10:05:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:22,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:05:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:22,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:05:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:05:22,687 INFO L87 Difference]: Start difference. First operand 13519 states and 22738 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:28,653 INFO L93 Difference]: Finished difference Result 56791 states and 93089 transitions. [2025-01-09 10:05:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:05:28,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 664 [2025-01-09 10:05:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:28,906 INFO L225 Difference]: With dead ends: 56791 [2025-01-09 10:05:28,906 INFO L226 Difference]: Without dead ends: 43275 [2025-01-09 10:05:28,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:05:28,978 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 1134 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:28,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 2137 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 10:05:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2025-01-09 10:05:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 36803. [2025-01-09 10:05:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36803 states, 25658 states have (on average 1.4906072180216696) internal successors, (38246), 25912 states have internal predecessors, (38246), 10888 states have call successors, (10888), 256 states have call predecessors, (10888), 256 states have return successors, (10888), 10634 states have call predecessors, (10888), 10888 states have call successors, (10888) [2025-01-09 10:05:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36803 states to 36803 states and 60022 transitions. [2025-01-09 10:05:32,715 INFO L78 Accepts]: Start accepts. Automaton has 36803 states and 60022 transitions. Word has length 664 [2025-01-09 10:05:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 36803 states and 60022 transitions. [2025-01-09 10:05:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-01-09 10:05:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 36803 states and 60022 transitions. [2025-01-09 10:05:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 10:05:32,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:32,748 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:05:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:05:32,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2073987538, now seen corresponding path program 1 times [2025-01-09 10:05:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701706068] [2025-01-09 10:05:32,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:32,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 10:05:33,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 10:05:33,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:33,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:05:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701706068] [2025-01-09 10:05:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701706068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:37,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:05:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860006278] [2025-01-09 10:05:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:37,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:05:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:37,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:05:37,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:05:37,353 INFO L87 Difference]: Start difference. First operand 36803 states and 60022 transitions. Second operand has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 15 states have internal predecessors, (157), 3 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 3 states have call predecessors, (102), 3 states have call successors, (102) [2025-01-09 10:05:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:51,521 INFO L93 Difference]: Finished difference Result 164621 states and 266564 transitions. [2025-01-09 10:05:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:05:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 15 states have internal predecessors, (157), 3 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 3 states have call predecessors, (102), 3 states have call successors, (102) Word has length 664 [2025-01-09 10:05:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:52,231 INFO L225 Difference]: With dead ends: 164621 [2025-01-09 10:05:52,231 INFO L226 Difference]: Without dead ends: 127821 [2025-01-09 10:05:52,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:05:52,422 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 4640 mSDsluCounter, 4976 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 1715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4640 SdHoareTripleChecker+Valid, 5773 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1715 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:52,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4640 Valid, 5773 Invalid, 5633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1715 Valid, 3918 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 10:05:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127821 states. [2025-01-09 10:05:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127821 to 75663. [2025-01-09 10:06:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75663 states, 52682 states have (on average 1.4806954937170191) internal successors, (78006), 53191 states have internal predecessors, (78006), 22211 states have call successors, (22211), 769 states have call predecessors, (22211), 769 states have return successors, (22211), 21702 states have call predecessors, (22211), 22211 states have call successors, (22211) [2025-01-09 10:06:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75663 states to 75663 states and 122428 transitions. [2025-01-09 10:06:00,519 INFO L78 Accepts]: Start accepts. Automaton has 75663 states and 122428 transitions. Word has length 664 [2025-01-09 10:06:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 75663 states and 122428 transitions. [2025-01-09 10:06:00,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 15 states have internal predecessors, (157), 3 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 3 states have call predecessors, (102), 3 states have call successors, (102) [2025-01-09 10:06:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 75663 states and 122428 transitions. [2025-01-09 10:06:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 10:06:00,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:00,569 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:06:00,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:06:00,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1997086740, now seen corresponding path program 1 times [2025-01-09 10:06:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719180541] [2025-01-09 10:06:00,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:00,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 10:06:00,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 10:06:00,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:00,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-01-09 10:06:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:01,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719180541] [2025-01-09 10:06:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719180541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:01,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:06:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233170410] [2025-01-09 10:06:01,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:01,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:06:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:01,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:06:01,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:06:01,213 INFO L87 Difference]: Start difference. First operand 75663 states and 122428 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102)