./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.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-96.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 04a66e3f5e0c01de9542e5e7b3340b25c89da9661ce4bdf3a3b49f3763c62dc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:09:57,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:09:57,308 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:09:57,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:09:57,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:09:57,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:09:57,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:09:57,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:09:57,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:09:57,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:09:57,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:09:57,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:09:57,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:09:57,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:09:57,353 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:09:57,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:09:57,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:09:57,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:09:57,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:09:57,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:09:57,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:09:57,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:09:57,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:09:57,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:57,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:57,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:57,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:57,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:57,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:09:57,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:09:57,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:09:57,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:09:57,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:09:57,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:09:57,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:09:57,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:09:57,358 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 -> 04a66e3f5e0c01de9542e5e7b3340b25c89da9661ce4bdf3a3b49f3763c62dc2 [2025-01-09 10:09:57,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:09:57,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:09:57,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:09:57,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:09:57,685 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:09:57,686 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-96.i [2025-01-09 10:09:58,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f950d00c8/7f4cbb6df06640a0b5e91a5991008c34/FLAG09601cb35 [2025-01-09 10:09:59,328 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:09:59,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-01-09 10:09:59,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f950d00c8/7f4cbb6df06640a0b5e91a5991008c34/FLAG09601cb35 [2025-01-09 10:09:59,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f950d00c8/7f4cbb6df06640a0b5e91a5991008c34 [2025-01-09 10:09:59,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:09:59,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:09:59,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:59,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:09:59,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:09:59,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:09:59,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10da6c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59, skipping insertion in model container [2025-01-09 10:09:59,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:09:59,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:09:59,558 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-96.i[916,929] [2025-01-09 10:09:59,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:59,793 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:09:59,803 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-96.i[916,929] [2025-01-09 10:09:59,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:59,912 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:09:59,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59 WrapperNode [2025-01-09 10:09:59,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:59,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:59,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:09:59,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:09:59,922 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:09:59" (1/1) ... [2025-01-09 10:09:59,950 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:09:59" (1/1) ... [2025-01-09 10:10:00,046 INFO L138 Inliner]: procedures = 26, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 889 [2025-01-09 10:10:00,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:10:00,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:10:00,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:10:00,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:10:00,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,142 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:10:00,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:10:00,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:10:00,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:10:00,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:10:00,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (1/1) ... [2025-01-09 10:10:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:10:00,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:10:00,289 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:10:00,292 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:10:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:10:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:10:00,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:10:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:10:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:10:00,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:10:00,506 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:10:00,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:10:01,999 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 10:10:02,000 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:10:02,026 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:10:02,026 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:10:02,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:02 BoogieIcfgContainer [2025-01-09 10:10:02,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:10:02,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:10:02,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:10:02,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:10:02,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:09:59" (1/3) ... [2025-01-09 10:10:02,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b85a9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:02, skipping insertion in model container [2025-01-09 10:10:02,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:59" (2/3) ... [2025-01-09 10:10:02,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b85a9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:02, skipping insertion in model container [2025-01-09 10:10:02,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:02" (3/3) ... [2025-01-09 10:10:02,039 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-01-09 10:10:02,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:10:02,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-96.i that has 2 procedures, 374 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:10:02,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:10:02,150 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;@32d0ec1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:10:02,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:10:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 10:10:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-01-09 10:10:02,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:02,201 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:02,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1818966576, now seen corresponding path program 1 times [2025-01-09 10:10:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572865033] [2025-01-09 10:10:02,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:02,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-01-09 10:10:02,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-01-09 10:10:02,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:02,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2025-01-09 10:10:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:03,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572865033] [2025-01-09 10:10:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572865033] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:10:03,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677262458] [2025-01-09 10:10:03,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:10:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:10:03,062 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:10:03,067 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:10:03,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-01-09 10:10:03,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-01-09 10:10:03,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:03,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:03,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:10:03,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:10:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2025-01-09 10:10:03,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:10:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677262458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:03,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:10:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:10:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141630533] [2025-01-09 10:10:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:03,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:10:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:10:03,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:10:03,696 INFO L87 Difference]: Start difference. First operand has 374 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) [2025-01-09 10:10:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:03,776 INFO L93 Difference]: Finished difference Result 738 states and 1384 transitions. [2025-01-09 10:10:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:10:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) Word has length 755 [2025-01-09 10:10:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:03,791 INFO L225 Difference]: With dead ends: 738 [2025-01-09 10:10:03,792 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 10:10:03,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 756 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:10:03,803 INFO L435 NwaCegarLoop]: 617 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, 617 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:10:03,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 10:10:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-01-09 10:10:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 246 states have (on average 1.5406504065040652) internal successors, (379), 246 states have internal predecessors, (379), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 10:10:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 617 transitions. [2025-01-09 10:10:03,910 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 617 transitions. Word has length 755 [2025-01-09 10:10:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:03,911 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 617 transitions. [2025-01-09 10:10:03,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) [2025-01-09 10:10:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 617 transitions. [2025-01-09 10:10:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-01-09 10:10:03,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:03,934 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,945 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:10:04,135 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:10:04,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:04,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1927609380, now seen corresponding path program 1 times [2025-01-09 10:10:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980389784] [2025-01-09 10:10:04,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:04,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-01-09 10:10:04,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-01-09 10:10:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:05,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980389784] [2025-01-09 10:10:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980389784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:10:05,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897266106] [2025-01-09 10:10:05,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:05,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:10:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:05,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:10:05,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:05,259 INFO L87 Difference]: Start difference. First operand 367 states and 617 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:05,719 INFO L93 Difference]: Finished difference Result 1375 states and 2319 transitions. [2025-01-09 10:10:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:10:05,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 755 [2025-01-09 10:10:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:05,739 INFO L225 Difference]: With dead ends: 1375 [2025-01-09 10:10:05,740 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 10:10:05,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:05,744 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 892 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:05,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 3037 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:10:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 10:10:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1002. [2025-01-09 10:10:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 735 states have (on average 1.5850340136054422) internal successors, (1165), 738 states have internal predecessors, (1165), 262 states have call successors, (262), 4 states have call predecessors, (262), 4 states have return successors, (262), 259 states have call predecessors, (262), 262 states have call successors, (262) [2025-01-09 10:10:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1689 transitions. [2025-01-09 10:10:05,882 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1689 transitions. Word has length 755 [2025-01-09 10:10:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:05,887 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1689 transitions. [2025-01-09 10:10:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1689 transitions. [2025-01-09 10:10:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-01-09 10:10:05,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:05,908 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:05,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:10:05,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:05,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 969029141, now seen corresponding path program 1 times [2025-01-09 10:10:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533323063] [2025-01-09 10:10:05,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:05,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-01-09 10:10:06,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-01-09 10:10:06,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:06,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:06,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:06,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533323063] [2025-01-09 10:10:06,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533323063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:06,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:06,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595113295] [2025-01-09 10:10:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:06,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:06,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:06,405 INFO L87 Difference]: Start difference. First operand 1002 states and 1689 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:06,555 INFO L93 Difference]: Finished difference Result 2992 states and 5045 transitions. [2025-01-09 10:10:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:06,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 756 [2025-01-09 10:10:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:06,579 INFO L225 Difference]: With dead ends: 2992 [2025-01-09 10:10:06,579 INFO L226 Difference]: Without dead ends: 1993 [2025-01-09 10:10:06,584 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:10:06,585 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 584 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:06,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1625 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:10:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-01-09 10:10:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1990. [2025-01-09 10:10:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1457 states have (on average 1.5648592999313657) internal successors, (2280), 1463 states have internal predecessors, (2280), 524 states have call successors, (524), 8 states have call predecessors, (524), 8 states have return successors, (524), 518 states have call predecessors, (524), 524 states have call successors, (524) [2025-01-09 10:10:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3328 transitions. [2025-01-09 10:10:06,853 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3328 transitions. Word has length 756 [2025-01-09 10:10:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:06,855 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3328 transitions. [2025-01-09 10:10:06,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3328 transitions. [2025-01-09 10:10:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-01-09 10:10:06,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:06,870 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:10:06,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:06,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1208358101, now seen corresponding path program 1 times [2025-01-09 10:10:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:06,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684649903] [2025-01-09 10:10:06,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-01-09 10:10:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-01-09 10:10:06,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:06,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:07,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:07,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684649903] [2025-01-09 10:10:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684649903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:07,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:07,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080729259] [2025-01-09 10:10:07,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:07,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:07,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:07,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:07,274 INFO L87 Difference]: Start difference. First operand 1990 states and 3328 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:07,533 INFO L93 Difference]: Finished difference Result 5536 states and 9268 transitions. [2025-01-09 10:10:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:07,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 756 [2025-01-09 10:10:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:07,561 INFO L225 Difference]: With dead ends: 5536 [2025-01-09 10:10:07,561 INFO L226 Difference]: Without dead ends: 3549 [2025-01-09 10:10:07,569 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:10:07,570 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 314 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:07,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1200 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:10:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2025-01-09 10:10:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3539. [2025-01-09 10:10:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 2726 states have (on average 1.5759354365370506) internal successors, (4296), 2740 states have internal predecessors, (4296), 796 states have call successors, (796), 16 states have call predecessors, (796), 16 states have return successors, (796), 782 states have call predecessors, (796), 796 states have call successors, (796) [2025-01-09 10:10:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 5888 transitions. [2025-01-09 10:10:07,948 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 5888 transitions. Word has length 756 [2025-01-09 10:10:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:07,951 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 5888 transitions. [2025-01-09 10:10:07,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 5888 transitions. [2025-01-09 10:10:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-01-09 10:10:07,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:07,962 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:07,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:10:07,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2109539161, now seen corresponding path program 1 times [2025-01-09 10:10:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:07,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739254386] [2025-01-09 10:10:07,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-01-09 10:10:08,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-01-09 10:10:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:08,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739254386] [2025-01-09 10:10:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739254386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862444310] [2025-01-09 10:10:08,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:08,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:08,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:08,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:08,382 INFO L87 Difference]: Start difference. First operand 3539 states and 5888 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:08,594 INFO L93 Difference]: Finished difference Result 7525 states and 12524 transitions. [2025-01-09 10:10:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 756 [2025-01-09 10:10:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:08,627 INFO L225 Difference]: With dead ends: 7525 [2025-01-09 10:10:08,627 INFO L226 Difference]: Without dead ends: 3989 [2025-01-09 10:10:08,640 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:10:08,641 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 321 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:08,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1209 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2025-01-09 10:10:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3251. [2025-01-09 10:10:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2766 states have (on average 1.6276211135213305) internal successors, (4502), 2772 states have internal predecessors, (4502), 472 states have call successors, (472), 12 states have call predecessors, (472), 12 states have return successors, (472), 466 states have call predecessors, (472), 472 states have call successors, (472) [2025-01-09 10:10:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 5446 transitions. [2025-01-09 10:10:08,949 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 5446 transitions. Word has length 756 [2025-01-09 10:10:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:08,951 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 5446 transitions. [2025-01-09 10:10:08,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 5446 transitions. [2025-01-09 10:10:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-01-09 10:10:08,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:08,962 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:10:08,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:08,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1291890711, now seen corresponding path program 1 times [2025-01-09 10:10:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191505261] [2025-01-09 10:10:08,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:09,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-01-09 10:10:09,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-01-09 10:10:09,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:09,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:09,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191505261] [2025-01-09 10:10:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191505261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:09,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:09,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021704767] [2025-01-09 10:10:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:09,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:09,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:09,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:09,740 INFO L87 Difference]: Start difference. First operand 3251 states and 5446 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:09,935 INFO L93 Difference]: Finished difference Result 8135 states and 13664 transitions. [2025-01-09 10:10:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 756 [2025-01-09 10:10:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:09,970 INFO L225 Difference]: With dead ends: 8135 [2025-01-09 10:10:09,971 INFO L226 Difference]: Without dead ends: 4887 [2025-01-09 10:10:09,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:10:09,984 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 388 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:09,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2025-01-09 10:10:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4883. [2025-01-09 10:10:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4883 states, 4156 states have (on average 1.6210298363811357) internal successors, (6737), 4165 states have internal predecessors, (6737), 708 states have call successors, (708), 18 states have call predecessors, (708), 18 states have return successors, (708), 699 states have call predecessors, (708), 708 states have call successors, (708) [2025-01-09 10:10:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 8153 transitions. [2025-01-09 10:10:10,279 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 8153 transitions. Word has length 756 [2025-01-09 10:10:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:10,280 INFO L471 AbstractCegarLoop]: Abstraction has 4883 states and 8153 transitions. [2025-01-09 10:10:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 8153 transitions. [2025-01-09 10:10:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-01-09 10:10:10,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:10,320 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:10,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:10:10,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1075685067, now seen corresponding path program 1 times [2025-01-09 10:10:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107869438] [2025-01-09 10:10:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:10,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-01-09 10:10:10,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-01-09 10:10:10,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:10,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107869438] [2025-01-09 10:10:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107869438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165483054] [2025-01-09 10:10:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:11,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:11,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:11,165 INFO L87 Difference]: Start difference. First operand 4883 states and 8153 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:11,573 INFO L93 Difference]: Finished difference Result 14643 states and 24453 transitions. [2025-01-09 10:10:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:11,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-01-09 10:10:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:11,653 INFO L225 Difference]: With dead ends: 14643 [2025-01-09 10:10:11,653 INFO L226 Difference]: Without dead ends: 9763 [2025-01-09 10:10:11,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:10:11,667 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 403 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:11,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9763 states. [2025-01-09 10:10:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9763 to 9761. [2025-01-09 10:10:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9761 states, 8308 states have (on average 1.618078960038517) internal successors, (13443), 8326 states have internal predecessors, (13443), 1416 states have call successors, (1416), 36 states have call predecessors, (1416), 36 states have return successors, (1416), 1398 states have call predecessors, (1416), 1416 states have call successors, (1416) [2025-01-09 10:10:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 16275 transitions. [2025-01-09 10:10:12,247 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 16275 transitions. Word has length 757 [2025-01-09 10:10:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:12,248 INFO L471 AbstractCegarLoop]: Abstraction has 9761 states and 16275 transitions. [2025-01-09 10:10:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 16275 transitions. [2025-01-09 10:10:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-01-09 10:10:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:12,270 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:12,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:10:12,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:12,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1856264128, now seen corresponding path program 1 times [2025-01-09 10:10:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:12,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953273875] [2025-01-09 10:10:12,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:12,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-01-09 10:10:12,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-01-09 10:10:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953273875] [2025-01-09 10:10:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953273875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364251574] [2025-01-09 10:10:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:12,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:12,627 INFO L87 Difference]: Start difference. First operand 9761 states and 16275 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:13,036 INFO L93 Difference]: Finished difference Result 19774 states and 32941 transitions. [2025-01-09 10:10:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 759 [2025-01-09 10:10:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:13,090 INFO L225 Difference]: With dead ends: 19774 [2025-01-09 10:10:13,092 INFO L226 Difference]: Without dead ends: 10016 [2025-01-09 10:10:13,120 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:10:13,121 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 365 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:13,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1570 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2025-01-09 10:10:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 9054. [2025-01-09 10:10:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9054 states, 8009 states have (on average 1.6252965413909353) internal successors, (13017), 8015 states have internal predecessors, (13017), 1008 states have call successors, (1008), 36 states have call predecessors, (1008), 36 states have return successors, (1008), 1002 states have call predecessors, (1008), 1008 states have call successors, (1008) [2025-01-09 10:10:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9054 states to 9054 states and 15033 transitions. [2025-01-09 10:10:13,653 INFO L78 Accepts]: Start accepts. Automaton has 9054 states and 15033 transitions. Word has length 759 [2025-01-09 10:10:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 9054 states and 15033 transitions. [2025-01-09 10:10:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 9054 states and 15033 transitions. [2025-01-09 10:10:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-01-09 10:10:13,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:13,672 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:10:13,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -402782379, now seen corresponding path program 1 times [2025-01-09 10:10:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057537917] [2025-01-09 10:10:13,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:13,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-01-09 10:10:13,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-01-09 10:10:13,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:13,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057537917] [2025-01-09 10:10:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057537917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451522083] [2025-01-09 10:10:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:14,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:14,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:14,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:14,324 INFO L87 Difference]: Start difference. First operand 9054 states and 15033 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:14,996 INFO L93 Difference]: Finished difference Result 26662 states and 44235 transitions. [2025-01-09 10:10:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 760 [2025-01-09 10:10:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:15,068 INFO L225 Difference]: With dead ends: 26662 [2025-01-09 10:10:15,069 INFO L226 Difference]: Without dead ends: 17611 [2025-01-09 10:10:15,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:10:15,100 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 364 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1285 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:10:15,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1285 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17611 states. [2025-01-09 10:10:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17611 to 17531. [2025-01-09 10:10:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17531 states, 15442 states have (on average 1.617277554720891) internal successors, (24974), 15454 states have internal predecessors, (24974), 2016 states have call successors, (2016), 72 states have call predecessors, (2016), 72 states have return successors, (2016), 2004 states have call predecessors, (2016), 2016 states have call successors, (2016) [2025-01-09 10:10:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17531 states to 17531 states and 29006 transitions. [2025-01-09 10:10:16,099 INFO L78 Accepts]: Start accepts. Automaton has 17531 states and 29006 transitions. Word has length 760 [2025-01-09 10:10:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 17531 states and 29006 transitions. [2025-01-09 10:10:16,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17531 states and 29006 transitions. [2025-01-09 10:10:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-01-09 10:10:16,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:16,123 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:10:16,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:16,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash 856861746, now seen corresponding path program 1 times [2025-01-09 10:10:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:16,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728386157] [2025-01-09 10:10:16,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:16,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-01-09 10:10:16,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-01-09 10:10:16,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:16,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728386157] [2025-01-09 10:10:16,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728386157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:16,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:16,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:16,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868633542] [2025-01-09 10:10:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:16,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:16,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:16,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:16,658 INFO L87 Difference]: Start difference. First operand 17531 states and 29006 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:17,279 INFO L93 Difference]: Finished difference Result 35139 states and 58208 transitions. [2025-01-09 10:10:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 762 [2025-01-09 10:10:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:17,386 INFO L225 Difference]: With dead ends: 35139 [2025-01-09 10:10:17,386 INFO L226 Difference]: Without dead ends: 26088 [2025-01-09 10:10:17,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:10:17,425 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 580 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:17,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1820 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26088 states. [2025-01-09 10:10:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26088 to 26008. [2025-01-09 10:10:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26008 states, 22875 states have (on average 1.616568306010929) internal successors, (36979), 22893 states have internal predecessors, (36979), 3024 states have call successors, (3024), 108 states have call predecessors, (3024), 108 states have return successors, (3024), 3006 states have call predecessors, (3024), 3024 states have call successors, (3024) [2025-01-09 10:10:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26008 states to 26008 states and 43027 transitions. [2025-01-09 10:10:18,824 INFO L78 Accepts]: Start accepts. Automaton has 26008 states and 43027 transitions. Word has length 762 [2025-01-09 10:10:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:18,825 INFO L471 AbstractCegarLoop]: Abstraction has 26008 states and 43027 transitions. [2025-01-09 10:10:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26008 states and 43027 transitions. [2025-01-09 10:10:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-01-09 10:10:18,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:18,852 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:10:18,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:18,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash -338318774, now seen corresponding path program 1 times [2025-01-09 10:10:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:18,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182396967] [2025-01-09 10:10:18,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:18,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-01-09 10:10:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-01-09 10:10:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182396967] [2025-01-09 10:10:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182396967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:19,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510143420] [2025-01-09 10:10:19,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:19,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:19,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:19,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:19,580 INFO L87 Difference]: Start difference. First operand 26008 states and 43027 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:20,493 INFO L93 Difference]: Finished difference Result 52013 states and 86051 transitions. [2025-01-09 10:10:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 762 [2025-01-09 10:10:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:20,618 INFO L225 Difference]: With dead ends: 52013 [2025-01-09 10:10:20,618 INFO L226 Difference]: Without dead ends: 26008 [2025-01-09 10:10:20,686 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:10:20,687 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 342 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:20,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 613 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26008 states. [2025-01-09 10:10:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26008 to 26008. [2025-01-09 10:10:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26008 states, 22875 states have (on average 1.6149945355191258) internal successors, (36943), 22893 states have internal predecessors, (36943), 3024 states have call successors, (3024), 108 states have call predecessors, (3024), 108 states have return successors, (3024), 3006 states have call predecessors, (3024), 3024 states have call successors, (3024) [2025-01-09 10:10:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26008 states to 26008 states and 42991 transitions. [2025-01-09 10:10:21,943 INFO L78 Accepts]: Start accepts. Automaton has 26008 states and 42991 transitions. Word has length 762 [2025-01-09 10:10:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:21,944 INFO L471 AbstractCegarLoop]: Abstraction has 26008 states and 42991 transitions. [2025-01-09 10:10:21,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26008 states and 42991 transitions. [2025-01-09 10:10:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-01-09 10:10:21,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:21,967 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:21,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:10:21,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:21,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash 642897604, now seen corresponding path program 1 times [2025-01-09 10:10:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:21,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980413866] [2025-01-09 10:10:21,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:22,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-01-09 10:10:22,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-01-09 10:10:22,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:22,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980413866] [2025-01-09 10:10:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980413866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:10:22,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200618419] [2025-01-09 10:10:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:22,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:10:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:22,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:10:22,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:22,710 INFO L87 Difference]: Start difference. First operand 26008 states and 42991 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:23,851 INFO L93 Difference]: Finished difference Result 60720 states and 100428 transitions. [2025-01-09 10:10:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:10:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-01-09 10:10:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:23,991 INFO L225 Difference]: With dead ends: 60720 [2025-01-09 10:10:23,991 INFO L226 Difference]: Without dead ends: 34715 [2025-01-09 10:10:24,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:24,053 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 585 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:24,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1828 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:10:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34715 states. [2025-01-09 10:10:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34715 to 34245. [2025-01-09 10:10:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34245 states, 30990 states have (on average 1.6285575992255565) internal successors, (50469), 31008 states have internal predecessors, (50469), 3143 states have call successors, (3143), 111 states have call predecessors, (3143), 111 states have return successors, (3143), 3125 states have call predecessors, (3143), 3143 states have call successors, (3143) [2025-01-09 10:10:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34245 states to 34245 states and 56755 transitions. [2025-01-09 10:10:25,559 INFO L78 Accepts]: Start accepts. Automaton has 34245 states and 56755 transitions. Word has length 764 [2025-01-09 10:10:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:25,560 INFO L471 AbstractCegarLoop]: Abstraction has 34245 states and 56755 transitions. [2025-01-09 10:10:25,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 34245 states and 56755 transitions. [2025-01-09 10:10:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-01-09 10:10:25,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:25,586 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:10:25,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 901063042, now seen corresponding path program 1 times [2025-01-09 10:10:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:25,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025307421] [2025-01-09 10:10:25,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:25,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-01-09 10:10:25,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-01-09 10:10:25,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:25,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:26,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025307421] [2025-01-09 10:10:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025307421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:26,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:26,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:10:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155838486] [2025-01-09 10:10:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:26,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:10:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:26,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:10:26,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:26,766 INFO L87 Difference]: Start difference. First operand 34245 states and 56755 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:28,835 INFO L93 Difference]: Finished difference Result 100283 states and 166275 transitions. [2025-01-09 10:10:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:10:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-01-09 10:10:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:29,061 INFO L225 Difference]: With dead ends: 100283 [2025-01-09 10:10:29,061 INFO L226 Difference]: Without dead ends: 68471 [2025-01-09 10:10:29,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:29,157 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 387 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:29,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1588 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:10:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68471 states. [2025-01-09 10:10:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68471 to 68226. [2025-01-09 10:10:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68226 states, 61839 states have (on average 1.6252365012370833) internal successors, (100503), 61875 states have internal predecessors, (100503), 6167 states have call successors, (6167), 219 states have call predecessors, (6167), 219 states have return successors, (6167), 6131 states have call predecessors, (6167), 6167 states have call successors, (6167) [2025-01-09 10:10:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68226 states to 68226 states and 112837 transitions. [2025-01-09 10:10:32,084 INFO L78 Accepts]: Start accepts. Automaton has 68226 states and 112837 transitions. Word has length 764 [2025-01-09 10:10:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:32,086 INFO L471 AbstractCegarLoop]: Abstraction has 68226 states and 112837 transitions. [2025-01-09 10:10:32,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-01-09 10:10:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 68226 states and 112837 transitions. [2025-01-09 10:10:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-01-09 10:10:32,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:32,115 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:32,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:10:32,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:32,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1102886976, now seen corresponding path program 1 times [2025-01-09 10:10:32,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:32,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097791081] [2025-01-09 10:10:32,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:32,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:32,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-01-09 10:10:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-01-09 10:10:32,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:32,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097791081] [2025-01-09 10:10:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097791081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:35,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:35,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:10:35,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910069103] [2025-01-09 10:10:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:35,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:10:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:35,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:10:35,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:10:35,671 INFO L87 Difference]: Start difference. First operand 68226 states and 112837 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-01-09 10:10:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:45,968 INFO L93 Difference]: Finished difference Result 212122 states and 349949 transitions. [2025-01-09 10:10:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:10:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) Word has length 764 [2025-01-09 10:10:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:46,415 INFO L225 Difference]: With dead ends: 212122 [2025-01-09 10:10:46,415 INFO L226 Difference]: Without dead ends: 160042 [2025-01-09 10:10:46,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:10:46,546 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 1648 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 1140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1140 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:46,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 3277 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1140 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 10:10:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160042 states. [2025-01-09 10:10:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160042 to 150964. [2025-01-09 10:10:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150964 states, 135108 states have (on average 1.6249888977706723) internal successors, (219549), 135288 states have internal predecessors, (219549), 15203 states have call successors, (15203), 652 states have call predecessors, (15203), 652 states have return successors, (15203), 15023 states have call predecessors, (15203), 15203 states have call successors, (15203) [2025-01-09 10:10:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150964 states to 150964 states and 249955 transitions. [2025-01-09 10:10:53,661 INFO L78 Accepts]: Start accepts. Automaton has 150964 states and 249955 transitions. Word has length 764 [2025-01-09 10:10:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:53,662 INFO L471 AbstractCegarLoop]: Abstraction has 150964 states and 249955 transitions. [2025-01-09 10:10:53,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-01-09 10:10:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 150964 states and 249955 transitions. [2025-01-09 10:10:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-01-09 10:10:53,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:53,744 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:53,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:10:53,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 285238526, now seen corresponding path program 1 times [2025-01-09 10:10:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158699686] [2025-01-09 10:10:53,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:53,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-01-09 10:10:53,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-01-09 10:10:53,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-01-09 10:10:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158699686] [2025-01-09 10:10:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158699686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:54,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:54,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770536990] [2025-01-09 10:10:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:54,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:54,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:54,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:54,082 INFO L87 Difference]: Start difference. First operand 150964 states and 249955 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119)